import sys
input = sys.stdin.readline
N = int(input())
mod = 10 ** 9 + 7

m = 3
move = [[0] * (1 << m) for _ in range(1 << m)]

for i in range(0, 5, 4):
  for j in range(0, 3, 2):
    for k in range(2):
      t = i + j + k

      if j: move[t][i | (k << 1) | 0] = 1
      if k and (i == 0 or j == 0): move[t][(i | (j << 1)) | 0 | 0] = 1
      if i == 0:
        move[t][4 | (k << 1) | 1] = 1
      if j == 0:
        move[t][i | (k << 1) | 1] = 1

def ArrayMultiple(a, b, mod):
  n = len(a)
  m = len(b[0])
  c = [[0] * n for _ in range(n)]
  for i in range(n):
    for j in range(m):
      for k in range(n):
        c[i][j] += a[i][k] * b[k][j]
        c[i][j] %= mod
  return c


def ArrayPower(a, k, mod):
  bn = list(bin(k)[2: ])
  ln = len(bn)
  n = len(a)
  bn.reverse()
  res = [[int(i == x) for i in range(n)] for x in range(n)]
  for i in range(ln):
    if int(bn[i]):
      res = ArrayMultiple(res, a, mod)
    a = ArrayMultiple(a, a, mod)
  return res

t = ArrayPower(move, N, mod)[0]
#print(t)
res = 0
if N % 2 == 0: res = t[0]
else: res = (t[1] + t[2] + t[4]) % mod
print(res)