import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

aa = [c-48 for c in BI()]
n = len(aa)

# dp[i][j][k][f] iケタみて、2の個数がj、5の個数がk、以下確定がf
dp = [[[[0]*2 for _ in range(3)] for _ in range(3)] for _ in range(n+1)]

def add(i, j, k, f, val):
    j = min(j, 2)
    k = min(k, 2)
    dp[i][j][k][f] = (dp[i][j][k][f]+val)%md

for i, a in enumerate(aa):
    dp[i][0][0][i>0]+=1
    for j in range(3):
        for k in range(3):
            for f in range(2):
                pre = dp[i][j][k][f]
                if pre == 0: continue
                if f:
                    add(i+1, j+2, k, f, pre*2)
                    add(i+1, j+1, k, f, pre*2)
                    add(i+1, j, k+1, f, pre)
                    add(i+1, j, k, f, pre*4)
                else:
                    for d in range(1,a):
                        if d%4 == 0: add(i+1, j+2, k, 1, pre)
                        elif d%2 == 0: add(i+1, j+1, k, 1, pre)
                        elif d%5 == 0: add(i+1, j, k+1, 1, pre)
                        else: add(i+1, j, k, 1, pre)
                    if a:
                        if a%4 == 0: add(i+1, j+2, k, 0, pre)
                        elif a%2 == 0: add(i+1, j+1, k, 0, pre)
                        elif a%5 == 0: add(i+1, j, k+1, 0, pre)
                        else: add(i+1, j, k, 0, pre)

print(sum(dp[-1][-1][-1])%md)