n = int(input())
mod = 10**9+7
ans = 0
dp = [0]*16
dp[0] = 1
for i in range(n):
    ndp = [0]*16
    for j in range(16):
        ndp[(j<<1)%16+1] += dp[j]
        ndp[(j<<1)%16+1] %= mod

        ndp[(j<<1)%16] += dp[j]
        ndp[(j<<1)%16] %= mod
    dp = ndp
    ans += dp[10]*pow(2,n-1-i,mod)
    ans %= mod
    dp[10] = 0
print(ans)