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 = 10 ** 9 + 7

if N < 3 :
    print(0)
else :
    # A0 G1 C2 T3
    # AGC,ACG,GACはすぐ消す
    # AGx,AxGにはCを足しちゃいけないことにする
    
    dp = [1] * 64
    dp[6] = dp[9] = dp[18] = 0
     
    for _ in range(N-3) :
        dp_ = [0] * 64
        for i in range(64) :
            for j in range(4) :
                if j == 2 and i in [1, 4, 5, 7, 13] :
                    continue
                ni = (i*4+j)%64
                dp_[ni] += dp[i]
                dp_[ni] %= mod
        dp = dp_
        dp[6] = dp[9] = dp[18] = 0
        
    print(sum(dp) % mod)