n = str(pow(10, int(input())))
m = len(n)
MOD = 1000_000_007
dp = [[[0]*12 for _ in range(2)] for _ in range(m+1)]
dp[0][0][0] = 1
for i in range(m):
    for smaller in range(2):
        limit = 10 if smaller else int(n[i])+1
        for j in range(10):
            for x in range(j, limit):
                dp[i+1][smaller | (x < int(n[i]))][x] += dp[i][smaller][j]
                dp[i+1][smaller | (x < int(n[i]))][x] %= MOD
ans = (sum(dp[m][0])+sum(dp[m][1])) % MOD
print(ans)