import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = 18446744073709551615
inf = 4294967295
md = 10**9+7
# md = 998244353
md1 = 10**9

s = list(map(int, SI()))
n = len(s)

for i in range(n//2):
    if s[i] > s[n-1-i]:
        s.reverse()
        break
s = s[:(n+1)//2]
# print(s)

m = md
for m in [md1, md]:
    cc = [0]
    for k in range(1, n):
        if k == 1: c = 9
        elif k & 1: c = cc[k-1]*10%m
        else: c = cc[k-1]
        cc.append(c)
    ans = 0
    for c in cc: ans = (ans+c)%m

    if s[0]:
        dp = [[0]*2 for _ in range(len(s)+1)]
        dp[0][0] = 1
        for i, a in enumerate(s):
            dp[i+1][0] += dp[i][0]
            if i:
                dp[i+1][1] += (dp[i][0]*a+dp[i][1]*10)%m
            else:
                dp[i+1][1] += dp[i][0]*(a-1)%m
        ans = (ans+dp[-1][0]+dp[-1][1])%m

    print(ans)