import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N=list(map(int,list(readline().rstrip())))
le=len(N)
for mod in (10**9,10**9+7):
    ans=0
    for i in range(1,le):
        ans+=9*pow(10,(i-1)//2,mod)
        ans%=mod
    if le>=2:
        dp=0
        for n in N[:le//2]:
            dp*=10
            dp+=n
            dp%=mod
        dp-=pow(10,le//2-1,mod)
        if le%2:
            dp*=10
            dp%=mod
        ans+=dp
        ans%=mod
    if le%2:
        for i in range(1 if le==1 else 0,10):
            if N[:le//2]+[i]+N[:le//2][::-1]<=N:
                ans+=1
                ans%=mod
    else:
        if N[:le//2]+N[:le//2][::-1]<=N:
            ans+=1
            ans%=mod
    print(ans)