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
# maspyさんの見て書いた。
# 最初自分で書いたけど、改善していたらほぼ写経になってしまった。。。

from collections import defaultdict

n = int(input())
m = 10**9+7

dp = [defaultdict(int) for i in range(n+1)]
dp[0]['']=1

def check(s):
    if 'AGC' in s:
        return False
    for i in range(len(s)-1):
        l = list(s)
        l[i],l[i+1]=l[i+1],l[i]
        t = ''.join(l)
        if 'AGC' in t:
            return False
    return True

for i in range(n):
    for k,v in dp[i].items():
        for x in 'AGCT':
            y = k[-3:]+x
            if check(y):
                dp[i+1][y]+=v

print(sum(dp[n].values())%m)

