import math,sequtils,strutils,unicode
proc powInt(n : int64, m : int64, k = 1_000_000_007):int64 =
    if m == 0:
        return 1
    elif m == 1:
        return (n mod k)
    if (m mod 2) == 0:
        return powInt((n*n) mod k,m div 2, k) mod k
    else:
        return (powInt((n*n) mod k,m div 2, k) * n) mod k
proc CToI(c : char):int =
    return( int(c) - int('0'))


var
    mod_Bill = (10.powInt(9)).int
    mod_Bill_7 = (10.powInt(9) + 7).int
    N : string
    p : int64
let N1 = stdin.readline
proc kaibun(N : string):int64 =
    var x = N.len
    var
        flag = 0
        X : seq[int64]
        i = 2
        a : int64
    X = @[9.int64,9.int64]
    while x > i:
        if (i mod 2) == 0:
            X.add(X[i - 1] * 10)
        else:
            X.add(X[i - 1])
        i += 1
    a = 0
    for i in X[0..len(X)-2]:
        a += i
    for j in 1..(x div 2):
        if j == 1:
            a = a + (N[j - 1].CToI - 1) * X[x - 2*j + 1] div 9
        else:
            a = a + N[j - 1].CToI * X[x - 2*j + 1] div 9
    for i in 0..<len(X) div 2:
        if N[i] > N[^(i + 1)]:
            break
        if i == len(N) div 2 - 1:
            a += 1
    if (x mod 2) == 1:
        a += N[x div 2].CToI
    return a
p = kaibun(N1)
echo p mod mod_Bill
echo p mod mod_Bill_7