import sys
#input = sys.stdin.readline #文字列につけてはダメ
#input = sys.stdin.buffer.readline #文字列につけてはダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
MOD = pow(10,9) + 7
#MOD = 998244353


def main():
    N = int(input())
    if N <= 3:
        print(0);exit()
    
    #繋がった4ケタがiの時,満たすのがdp[i][0], 満たさないのがdp[i][1]
    dp = [[0,1] for _ in range(16)]
    dp[10] = [1,0]

    for i in range(N-4):
        p = [[0,0] for _ in range(16)]
        dp,p = p,dp
        for v in range(16):
            #次の位が0
            nv = (v%8) * 2
            if nv == 10:
                dp[nv][0] += p[v][0] + p[v][1]
            else:
                dp[nv][0] += p[v][0]
                dp[nv][1] += p[v][1]
            #次の位が1
            nv += 1
            dp[nv][0] += p[v][0]
            dp[nv][1] += p[v][1]
            #MOD
            dp[nv][0] %= MOD
            dp[nv][1] %= MOD
        #print(dp)
        #s = 0
        #for i in range(16):
        #    for j in range(2):
        #        s += dp[i][j]
        #print("s",s)

    ans = 0
    for v in range(16):
        ans += dp[v][0]
    print(ans%MOD)        

if __name__ == '__main__':
    main()