Okabe Rintaro, the mad scientist, is close to opening the Stein's;Gate but for that, he needs to solve the following problem:

He is given a very huge number and he needs to find the sum of all its subsets. A subset of this number is obtained by removing certain digits and arranging the remaining digits in the same order.

Since he is already exhausted from jumping through so many timelines, he needs your help!

INPUT:
A huge number, N.

CONSTRAINTS:
$0 < N < 10^{1000}$

OUTPUT:
Since the answer can be huge, print it modulo $10^9+7$.