import sys
import math
import collections
import bisect
import itertools
import decimal
import heapq


# sys.setrecursionlimit(10**6+1)
inf = 10**20
mod = 10 ** 9 + 7
# MOD = 998244353


def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))
def na1(): return list(map(lambda x: int(x)-1, sys.stdin.buffer.readline().split()))
def nall(): return list(map(int, sys.stdin.buffer.read().split()))
def flush(): return sys.stdout.flush()


def nic(): return int(sys.stdin.readline())
def nsc(): return map(int, sys.stdin.readline().split())
def nac(): return list(map(int, sys.stdin.readline().split()))
def na1c(): return list(map(lambda x: int(x)-1, sys.stdin.readline().split()))


# ===CODE==
def main():
    s = input()
    l = len(s)

    res = 0
    base = 45
    for i in range(l-1):
        res += pow(base, i+1, mod)

    head = 1
    for i in range(l-1):
        keta = l-i
        v = int(s[i])
        cum = v*(v-1)//2
        res += head*cum*pow(base, keta-1, mod)
        res %= mod
        head *= v
        head %= mod

    # 1桁目は特別処理
    tail = int(s[-1])
    cum = tail*(tail+1)//2
    res += head*cum
    res %= mod

    print(res)


if __name__ == '__main__':
    main()