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

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

m=[{} for i in range(n+1)]
def f(num,s):
    if s in m[num]:
        return m[num][s]
    if num==n:
        return 1
    ans=0
    for c in "ACGT":
        if d(s+c):
            ans=(ans+f(num+1,s[1:3]+c))%mod
    m[num][s]=ans
    return ans

print(f(0,"PPP"))
        
        



