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
MOD = 10**9 + 7
memo = {}

def ok(last4):
    if "AGC" in last4:
        return False
    for i in range(3):
        s = list(last4)
        s[i], s[i+1] = s[i+1], s[i]
        if "AGC" in "".join(s):
            return False
    return True

def dfs(d, last3):
    if d < 0:
        return 1
    if not (d, last3) in memo:
        res = 0
        for c in "ACGT":
            last4 = last3 + c
            if ok(last4):
                res = (res + dfs(d-1, last4[-3:])) % MOD
        memo[d, last3] = res
    return memo[d, last3]

def solve(n):
    return dfs(n-1, "###")

n = int(input())
print(solve(n))