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())
mod = 10 ** 9 + 7

memo = [{} for _ in range(N + 1)]

def valid(S):
    for i in range(4):
        t = list(S)
        if i >= 1:
            t[i - 1], t[i] = t[i], t[i - 1]
        if "AGC" in "".join(t):
            return False
    return True

def dfs(cur, S):
    if S in memo[cur]:
        return memo[cur][S]
    if cur == N:
        return 1

    count = 0
    for c in "ACGT":
        if valid(S + c):
            count = (count + dfs(cur + 1, S[1:] + c)) % mod
    memo[cur][S] = count
    return count

print(dfs(0, "TTT"))
