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())
x=10**9+7
sa=[1,4,16]
sg=[1,4,15]
sc=[1,4,14]
st=[1,4,16]
for i in range(3,n):
    sa.append(sa[i-1]+sg[i-1]+sc[i-1]+st[i-1])
    sg.append(sa[i-1]+sg[i-1]+(sc[i-1]-sa[i-2]+sg[i-3])+st[i-1])
    sc.append((sa[i-1]-sg[i-2])+(sg[i-1]-sa[i-2]-sa[i-3]-sa[i-3])+(sc[i-1])+(st[i-1]-sa[i-3]))
    st.append(sa[i-1]+sg[i-1]+sc[i-1]+st[i-1])
n=n-1
print((sa[n]+sg[n]+sc[n]+st[n])%x)
