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())
d={}
mod=10**9+7
from itertools import product
import re
for t in product('ATGC',repeat=3):
    s=''.join(t)
    d[s]=[0]*(N-2)
    d[s][0]=0 if s in ['AGC','ACG','GAC'] else 1
p=re.compile('.AGC|.ACG|.GAC|A.GC|AG.C')
for i in range(N-3):
    for t in product('ATGC',repeat=3):
        for c in 'ATGC':
            s=''.join(t)+c
            if p.search(s)==None:
                d[s[1:]][i+1]=(d[s[1:]][i+1]+d[s[:-1]][i])%mod
print(sum([i[-1] for i in d.values()])%mod)