Problem:
Score : 300 points

Problem Statement

You are given a string S consisting of digits between 1 and 9, inclusive.
You can insert the letter + into some of the positions (possibly none) between two letters in this string.
Here, + must not occur consecutively after insertion.

All strings that can be obtained in this way can be evaluated as formulas.

Evaluate all possible formulas, and print the sum of the results.

Constraints

1 \leq |S| \leq 10

All letters in S are digits between 1 and 9, inclusive.

Input

The input is given from Standard Input in the following format:

S

Output

Print the sum of the evaluated value over all possible formulas.

Sample Input 1

125

Sample Output 1

176

There are 4 formulas that can be obtained: 125, 1+25, 12+5 and 1+2+5. When each formula is evaluated,

125

1+25=26

12+5=17

1+2+5=8

Thus, the sum is 125+26+17+8=176.

Sample Input 2

9999999999

Sample Output 2

12656242944

Solution in Ruby (2.3.3) (judge verdict: Accepted)

=begin
－－－－－－－－－－－－－－
S = 文字列で表した数値
N = S の文字数
ans = 合計値
res = '+'ごとのに区切った数値の合計を格納
tmp = '+'ごとに区切った数値を格納
－－－－－－－－－－－－－－

1: '+' が挿入される箇所をbit全探索(N-1)する(フラグが立っている場合 + が挿入されるとする)
  1.1: S をループし、+ が挿入されるまで S[i] を区切って tmp に代入していく
    1.1.1: bit の i番目 にフラグが立っている場合、 現時点での tmp を ans に 加算して tmp を 0 に戻す
2: ans を出力する
=end

S = gets.chomp.chars;
N = S.size() - 1;
ans = 0;

bit = 0;
while bit < (1<<N) do
  res = tmp = 0;
  S.each_with_index do |v,i|
    tmp *= 10;
    tmp += v.to_i;
    if bit[i] != 0
      res += tmp;
      tmp = 0;
    end
  end
  ans += res + tmp;
  bit += 1;
end

puts ans