Closed Walks on Bipartite K33

Difficulty: 1800 4000 ms 128 MB

graphs matrix-exponentiation

Count the closed walks of length N starting and ending at vertex 1 in the graph Bipartite K33, modulo 10⁹+7.

Input: one integer N.

Output: the number of closed walks mod 10⁹+7.

Constraints:

• 0 ≤ N ≤ 10¹⁸

Sample Tests

2

3

0

1

Read the Editorial