n = int(input())
mod = 10**9 + 7

dp = [[0]*10 for _ in range(n+1)]
# dp[i][j] := i桁目までで, jが最高位.
dp[0][0] = 1

for i in range(n):
	for j in range(10):
		dp[i+1][j] = sum(dp[i][0:j+1]) % mod
print(sum(dp[n])%mod)