Digit Power Sum

Number the digits of n from the left, starting at 1. Raise each digit to the power of its position and add the results. For 352 that is 3¹ + 5² + 2³. A zero digit adds 0.

Implement digit_power_sum(n).

Input

n: A positive integer.

Output

Return the sum of the powered digits.

Vincoli

1 ≤ n ≤ 1,000,000,000

Esempi

Input:
n = 352

Output atteso:
expected = 36

Input:
long long n = 352;

Output atteso:
long long expected = 36;

Input:
long n = 352;

Output atteso:
long expected = 36;

Input:
n = 89

Output atteso:
expected = 89

Input:
long long n = 89;

Output atteso:
long long expected = 89;

Input:
long n = 89;

Output atteso:
long expected = 89;