# import sys
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
import math
import bisect
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e30)
mod = int(1e9+7)

n = input()
nb = [n[0]]
now = n[0]
for i in range(1,len(n)):
    if now != "0":
        now = n[i]
        nb.append(now)
    else:nb.append(now)
n = "".join(nb)
dp0 = [[[[0]*3 for j in range(3)] for i in range(len(n)+1)] for v in range(2)]
dp1 = [[[[0]*3 for j in range(3)] for i in range(len(n)+1)] for v in range(2)]
dp0[0][0][0][0] = 1

for v in range(2):
    for i in range(len(n)):
        for j in range(3):
            for k in range(3):
                for l in range(10):
                    if l > int(n[i]):
                        if l == 2 or l == 6:
                            dp1[1][i+1][min(2,j+1)][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][min(2, j + 1)][k] %= mod
                        elif l == 5:
                            dp1[1][i+1][j][min(2,k+1)] += dp1[v][i][j][k]
                            dp1[1][i + 1][j][min(2, k + 1)] %= mod
                        elif l == 4 or l == 8:
                            dp1[1][i+1][2][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][2][k] %= mod
                        else:
                            dp1[1][i+1][j][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][j][k] %= mod
                    elif l == int(n[i]):
                        if l == 2 or l == 6:
                            dp0[1][i+1][min(2,j+1)][k] += dp0[v][i][j][k]
                            dp0[1][i + 1][min(2, j + 1)][k] %= mod
                            dp1[1][i+1][min(2,j+1)][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][min(2, j + 1)][k] %= mod
                        elif l == 5:
                            dp0[1][i + 1][j][min(2, k + 1)] += dp0[v][i][j][k]
                            dp0[1][i + 1][j][min(2, k + 1)] %= mod
                            dp1[1][i+1][j][min(2,k+1)] += dp1[v][i][j][k]
                            dp1[1][i + 1][j][min(2, k + 1)] %= mod
                        elif l == 4 or l == 8:
                            dp0[1][i+1][2][k] += dp0[v][i][j][k]
                            dp0[1][i + 1][2][k] %= mod
                            dp1[1][i+1][2][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][2][k] %= mod
                        elif l == 0:
                            if v == 0:
                                dp1[0][i+1][j][k] += dp0[0][i][j][k]
                                dp1[0][i + 1][j][k] %= mod
                                dp1[0][i+1][j][k] += dp1[0][i][j][k]
                                dp1[0][i + 1][j][k] %= mod
                        else:
                            dp0[1][i+1][j][k] += dp0[v][i][j][k]
                            dp0[1][i + 1][j][k] %= mod
                            dp1[1][i+1][j][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][j][k] %= mod
                    else:
                        if l == 2 or l == 6:
                            dp1[1][i+1][min(2,j+1)][k] += dp0[v][i][j][k]
                            dp1[1][i + 1][min(2, j + 1)][k] %= mod
                            dp1[1][i+1][min(2,j+1)][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][min(2, j + 1)][k] %= mod
                        elif l == 5:
                            dp1[1][i + 1][j][min(2, k + 1)] += dp0[v][i][j][k]
                            dp1[1][i + 1][j][min(2, k + 1)] %= mod
                            dp1[1][i+1][j][min(2,k+1)] += dp1[v][i][j][k]
                            dp1[1][i + 1][j][min(2, k + 1)] %= mod
                        elif l == 4 or l == 8:
                            dp1[1][i+1][2][k] += dp0[v][i][j][k]
                            dp1[1][i + 1][2][k] %= mod
                            dp1[1][i+1][2][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][2][k] %= mod
                        elif l == 0:
                            if v == 0:
                                dp1[0][i+1][j][k] += dp0[0][i][j][k]
                                dp1[0][i + 1][j][k] %= mod
                                dp1[0][i+1][j][k] += dp1[0][i][j][k]
                                dp1[0][i + 1][j][k] %= mod
                        else:
                            dp1[1][i+1][j][k] += dp0[v][i][j][k]
                            dp1[1][i + 1][j][k] %= mod
                            dp1[1][i+1][j][k] += dp1[v][i][j][k]
                            dp1[1][i + 1][j][k] %= mod
print((dp0[0][len(n)][2][2] + dp1[0][len(n)][2][2] + dp0[1][len(n)][2][2] + dp1[1][len(n)][2][2])%mod)