You are given an integer N. Find the number of strings of length N that satisfy the following conditions, modulo 10^9+7:

* The string does not contain characters other than `A`, `C`, `G` and `T`.
* The string does not contain `AGC` as a substring.
* The condition above cannot be violated by swapping two adjacent characters once.

Constraints

* 3 \leq N \leq 100

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of strings of length N that satisfy the following conditions, modulo 10^9+7.

Examples

Input

3


Output

61


Input

4


Output

230


Input

100


Output

388130742
N = int(input())
ng = ["agc", "aagc", "acgc", "aggc", "atgc", "agac", "agcc", "aggc", "agtc", "acg", "gac"]
c = 0

x = {"a": 1, "g": 1, "c": 1, "t": 1}
for _ in range(N - 1):
    y = {}
    for k, v in x.items():
        n = k[-3:]
        for s in ["a", "c", "g", "t"]:
            if n + s in ng or (n + s)[-3:] in ng:
                continue
            if n + s in y.keys():
                y[n + s] += v
            else:
                y[n + s] = v
    x = y

print(sum(x.values()) % 1000000007)





