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())

s = ['A', 'C', 'G', 'T']
invs = ['AGC', 'ACG', 'GAC']

d = {}
for c1 in s:
    for c2 in s:
        for c3 in s:
            d[c1+c2+c3] = 1 if c1+c2+c3 not in invs else 0

dn = {}
for _ in range(N - 3):
    for c1 in s:
        for c2 in s:
            for c3 in s:
                cnt = 0
                for c0 in s:
                    if c0+c2+c3!='AGC' and c0+c1+c3!='AGC':
                        cnt += d[c0+c1+c2]
                dn[c1+c2+c3] = cnt%1000000007 if c1+c2+c3 not in invs else 0
    dn, d = d, dn

print(sum(d.values())%1000000007)



