def cmb(n, r, mod):#コンビネーションの高速計算　
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod

mod = 998244353#出力の制限
N = 2*10**3
g1 = [1]*(N+1) # 元テーブル
g2 = [1]*(N+1) #逆元テーブル
inverse = [1]*(N+1) #逆元テーブル計算用テーブル

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

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

r = [1,2,4,5,10,20,25,50,100]
cond = {r:i for i,r in enumerate(r)}
def conv(i):
    cnt_2,cnt_5 = 0,0
    while i and i%2==0:
        cnt_2 += 1
        i //= 2
    while i and i%5==0:
        cnt_5 += 1
        i //= 5
    cnt_2,cnt_5 = min(cnt_2,2),min(cnt_5,2)
    return cond[2**cnt_2 * 5**cnt_5]


dp = [[[0 for i in range(9)] for bit in range(2)] for i in range(n)]
for i in range(1,10):
    c = conv(i)
    dp[0][1][c] += 1
    if i<=int(N[-1]):
        dp[0][0][c] += 1

res = 0
for i in range(n):
    s = int(N[-i-1])
    for j in range(9):
        a = r[j]
        for k in range(1,10):
            next = conv(a*k)
            if s>k:
                dp[i][0][next] += dp[i-1][1][j]
            elif s==k:
                dp[i][0][next] += dp[i-1][0][j]
            dp[i][0][next] %= mod

            dp[i][1][next] += dp[i-1][1][j]
            dp[i][0][next] %= mod

    if i!=n-1:
        res += dp[i][1][8]
    else:
        res += dp[i][0][8]
    res %= mod

print(res)