Ross, Chandler and Joey are best friends. One day they went to pond and Joey suggest them to play the game "Bamboozle". In this game they have N balls with each numbered from 0-9, but first ball is numbered from 1-9. Ross tells sub-strings 'S' formed by those balls and Chandler throws S stones into the pond. At last, Joey have to tell total how many stones Chandler throw in to the pond, 'T'.

But Joey is poor in maths, So help Joey to win the game and make bamboozle of Chandler and Ross.

NOTE: The answer can be very large, Joey to tell T%(10^9+7) instead. 

INPUT

A single line containing a string of numbers that appear on the first, second, third ball and so on.

OUTPUT

A single line which is the total number of stones that Chandler throws in to the pond, T%(1000000007).

Constraints

1 ≤ N ≤ 200000

SAMPLE INPUT
16

SAMPLE OUTPUT
23

Explanation

The sub-string of number 16 are 16, 1 and 6 whose sum is 23.
s=raw_input()
len1=len(s)
mul_ten=1
sum1=1
total_sum=len1*int(s[len1-1])
 
 
for i in range(len1-2,-1,-1):
    mul_ten=(mul_ten*10)%1000000007
    sum1=sum1+mul_ten
    total_sum=(total_sum+(sum1*(i+1))*int(s[i]))%1000000007
 
 
print total_sum%1000000007