S = list(input())
N = len(S)
mod = 10 ** 9 + 7
dp = [[[[0] * 100 for i in range(2)] for j in range(2)] for k in range(N + 1)]
dp[0][0][0][1] = 1
for i in range(N):
    n = int(S[i])
    for j in range(2):
        for k in range(100):
            for m in range(2):
                for d in range(10):
                    ni = i + 1
                    nj = 1
                    nk = (k * d)%100
                    nm = 1
                    if j == 0 and d > n:
                        continue
                    if j == 0 and d == n:
                        nj = 0
                    if d == 0:
                        if m == 0:
                            nk = 1
                            nm = 0
                        else:
                            continue  
                    dp[ni][nj][nm][nk] += dp[i][j][m][k]
                    dp[ni][nj][nm][nk] %= mod
ans = 0
for i in range(2):
    for j in range(2):
        ans += dp[N][i][j][0]
        ans %= mod
print(ans)