from itertools import product

N = input()
mod=10**9+7

def count(a):
    n = len(a)
    dp=[[[[0] * 2 for i in range(100)] for j in range(2)] for k in range(n+1)]
    dp[0][0][1][0] = 1

    for i, less, mod100, has0 in product(range(n), (0,1), range(100), (0,1)):
        max_d = 9 if less else int(a[i])
        for d in range(max_d+1):
            less_ = less or d < max_d
            mod100_ = (mod100*d)%100
            has0_ = has0 or d==0
            dp[i + 1][less_][mod100_][has0_] += dp[i][less][mod100][has0]

    return dp[n][1][0][0]+dp[n][0][0][0]

ans = count(N)
for i in range(len(N)):
    ans += count('9'*i)
print(ans%mod)