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

s = SI()
n = len(s)
aa = [int(c) for c in s]

cm = [1]
for a in aa:
    cm.append(cm[-1]*a%md)
# print(cm)

cs = [0]
for i in range(1, 10):
    cs.append(cs[-1]+i)
# print(cs)

ans = cm[-1]
for i in range(n-1, -1, -1):
    if aa[i] == 0: continue
    ans += (cs[aa[i]-1])*pow(45, n-1-i, md)*cm[i]%md
    ans %= md

for k in range(1, n):
    ans += pow(45, k, md)
    ans %= md

print(ans)