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()))) mod=10**9+7 ans=0 for n in range(1,N[0]): ans+=n p=N[0] for n in N[1:]: ans*=45 ans+=45 ans+=p*n*(n-1)//2 ans%=mod p*=n p%=mod ans+=p ans%=mod print(ans)