mod = 10 ** 9 + 7

digits = [int(c) for c in input()]
digits[-1] += 1
l = len(digits)

factors = [1, 2, 4, 5, 10, 20, 25, 50, 100]
d_map1 = [0, 1, 2, 1, 4, 5, 2, 1, 4, 1]
d_map2 = {1: 1, 2: 2, 4: 4, 5: 5, 8: 4, 10: 10, 16: 4, 20: 20, 25: 25, 40: 20, 50: 50, 80: 20, 100: 100, 125: 25, 200: 100, 250: 50, 400: 100, 500: 100}

ans = 0
dp = [{f: 0 for f in factors} for _ in range(l)]
dp[0][1] = 1
for i in range(1, l):
    ndp = dp[i]
    for d in range(1, 10):
        d1 = d_map1[d]
        for k, v in dp[i - 1].items():
            ndp[d_map2[k * d1]] += v
    dp[i] = {f: v % mod for f, v in dp[i].items()}
ans = sum(dp[i][100] for i in range(l)) % mod

prefix = 1
for ind, c in enumerate(digits, start=1):
    pre_dp = {f: 0 for f in factors}
    for d in range(1, c):
        pre_dp[d_map2[prefix * d_map1[d]]] += 1
    for k1, v1 in dp[l - ind].items():
        for k2, v2 in pre_dp.items():
            if k1 * k2 % 100 == 0:
                ans = (ans + v1 * v2) % mod
    if c == 0:
        break
    prefix = d_map2[prefix * d_map1[c]]
print(ans)