from itertools import product

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

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

    for i, less, divcnt5, divcnt2, lzero in product(range(n), (0,1), range(3), range(3), (0,1)):
        max_d = 9 if less else int(a[i])
        for d in range(max_d+1):
            if lzero==0 and d==0:
                continue
            less_ = less or d < max_d
            divcnt5_ = min(2,divcnt5+(d==5))
            divcnt2_ = min(2,divcnt2+candiv2[d])
            lzero_ = lzero and d==0
            dp[i + 1][less_][divcnt5_][divcnt2_][lzero_] = (dp[i + 1][less_][divcnt5_][divcnt2_][lzero_] + dp[i][less][divcnt5][divcnt2][lzero])%mod

    return (dp[n][0][2][2][0]+dp[n][1][2][2][0])%mod

print(count(N))