mod = 10**9+7

n = int(input())
if(n <= 3):
	print(0)
	exit(0)

dp = [1]*8
for _ in [0]*(n-3):
	ndp = [0]*8
	ndp[0] = (dp[0] + dp[4]) % mod
	ndp[1] = (dp[0] + dp[4]) % mod
	ndp[2] = dp[1]
	ndp[3] = (dp[1] + dp[5]) % mod
	ndp[4] = (dp[2] + dp[6]) % mod
	ndp[5] = (dp[2] + dp[6]) % mod
	ndp[6] = (dp[3] + dp[7]) % mod
	ndp[7] = (dp[3] + dp[7]) % mod
	dp = ndp
ans = (pow(2,n,mod) + mod*10 - sum(dp)) % mod

print(ans)