mod = 10 ** 9 + 7
n = input()
ans = 0
for i in range(len(n) - 1):
    ans += pow(45, i + 1, mod)
    ans %= mod
cur = 1
leng = len(n)
for i in range(leng - 1):
    m = int(n[i])
    ans += cur * m * (m - 1) // 2 * pow(45, leng - i - 1, mod) % mod
    cur *= m
    ans %= mod
print((ans + cur * int(n[-1]) * (int(n[-1]) + 1) // 2))