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

DENOM = 10 ** 9 + 7

memo = [{} for i in range(N + 1)]

BASE = "ACGT"
AGC = "AGC"


def check(last4):
  for i in range(4):
    tmp = list(last4)
    if i >= 1:
      tmp[i-1], tmp[i] = tmp[i], tmp[i-1]
    if AGC in "".join(tmp):
      return False
  return True


def dfs(cur, last3):
  ret = 0
  if last3 in memo[cur]:
    return memo[cur][last3]
  if cur == N:
    return 1
  for c in BASE:
    if check(last3 + c):
      ret = (ret + dfs(cur + 1, last3[1:] + c)) % DENOM

  memo[cur][last3] = ret
  return ret

print(dfs(0, "TTT"))