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][0] = 1

    for i, less, divcnt5, divcnt2, has0 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):
            less_ = less or d < max_d
            divcnt5_ = min(2,divcnt5+(d==5))
            if d==4 or d==8:
                divcnt2_=2
            elif d==2 or d==6:
                divcnt2_=min(2,divcnt2+1)
            else:
                divcnt2_ = divcnt2
            has0_ = has0 or d==0
            dp[i + 1][less_][divcnt5_][divcnt2_][has0_] = (dp[i + 1][less_][divcnt5_][divcnt2_][has0_] + dp[i][less][divcnt5][divcnt2][has0])%mod

    return dp

dp = count(N)
ans = (dp[-1][0][2][2][0]+dp[-1][1][2][2][0])%mod
dp = count('9'*(len(N)-1))
for i in range(len(N)):
    ans = (ans + dp[i][0][2][2][0]+dp[i][1][2][2][0])%mod
print(ans)