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
n=int(input())
a=[{} for i in range(n+1)]
def C(last4):
    if last4[:3]=='AGC' or last4[1:]=='AGC':
        return False
    for i in range(3):
        tmp=list(last4)
        tmp[i], tmp[i+1]=tmp[i+1], tmp[i]
        if ''.join(tmp).count('AGC')>0:
            return False
    return True
a[0]['TTT']=1
for i in range(1, n+1):
    for k, v in a[i-1].items():
        for c in 'ACGT':
            if C(k+c):
                if k[1:]+c in a[i]:
                    a[i][k[1:]+c]+=v
                else:
                    a[i][k[1:]+c]=v
print(sum(a[n].values())%mod)