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 = int(1e9+7)
dp = [[0 for i in range(4)]for k in range(n+1)] #ACGTの順
for i in range(4):
    dp[1][i] = 1
    dp[2][i] = 4
dp[3][0] = 16
dp[3][1] = 14
dp[3][2] = 15
dp[3][3] = 16
for i in range(4,n+1):
    for k in range(4):
        dp[i][k] = sum(dp[i-1])%mod
    dp[i][1] = dp[i][1] - (dp[i-2][0] + dp[i-2][2]) - dp[i-3][0]*3
    dp[i][2] = dp[i][2] - dp[i-2][0] + dp[i-3][2]
print(sum(dp[n])%mod)