# OEIS 解です！

mod = 10 ** 9 + 7


def mat_mul(l, r):
	ret = [[0] * 15 for _ in range(15)]
	for i in range(15):
		reti = ret[i]
		li = l[i]
		for k in range(15):
			lik = li[k]
			rk = r[k]
			for j in range(15):
				reti[j] += (lik * rk[j])
				reti[j] %= mod
	return ret


def mat_pow(A, m):
	B = [[0] * 15 for _ in range(15)]

	for i in range(15):
		B[i][i] = 1

	while m:
		if m & 1:
			B = mat_mul(B, A)
		A = mat_mul(A, A)
		m >>= 1
	return B


def solve(n):
	anss = [0, 2, 5, 22, 75, 264, 941, 3286, 11623, 40960, 144267, 508812, 1792981, 6319994, 22277291, 78518760]

	if n <= 15:
		return anss[n]

	A = [[0] * 15 for _ in range(15)]
	A[0] = [1, 5, 11, 5, 14, 8, 3, 0, -5 + mod, -11 + mod, -1 + mod, 2, 0, 0, 1]
	for i in range(1, 15):
		A[i][i-1] = 1

	A = mat_pow(A, n-15)

	ans = 0
	for i in range(15):
		ans += A[0][i] * anss[15-i]
		ans %= mod

	return ans


print(solve(int(input())))