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
#encoding: utf-8

n, mod = int(input()), 10 ** 9 + 7


memo = [{} for i in range(n + 1)]

def check(last):
    for i in range(4):
        t = list(last)
        if i >= 1:
            t[i - 1], t[i] = t[i], t[i - 1]
        if "".join(t).count("AGC") >= 1:
            return 0
    return 1

def dfs(cnt, last):
    if last in memo[cnt]:
        return memo[cnt][last]
    if cnt == n:
        return 1
    ret = 0
    for c in "ACGT":
        if check(last + c):
            ret = (ret + dfs(cnt + 1, last[1:] + c)) % (10 ** 9 + 7)
    memo[cnt][last] = ret 
    return ret 

print(dfs(0, "TTT"))