import sys, re

from collections import deque, defaultdict, Counter

from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2

from itertools import accumulate, permutations, combinations, product, groupby

from operator import itemgetter, mul

from copy import deepcopy

from string import ascii_lowercase, ascii_uppercase, digits

from bisect import bisect, bisect_left

from fractions import gcd

from heapq import heappush, heappop

from functools import reduce

import numpy as np

def input(): return sys.stdin.readline().strip()

def INT(): return int(eval(input()))

def MAP(): return list(map(int, input().split()))

def LIST(): return list(map(int, input().split()))

def ZIP(n): return list(zip(*(MAP() for _ in range(n))))

sys.setrecursionlimit(10 ** 9)

INF = float('inf')

mod = 10 ** 9 + 7

 

S = list(eval(input()))



l = len(S)



anss = []

for i in range(1<<l-1):

	ans = []

	i = list("{:b}".format(i).zfill(l-1))

	#print(i)

	S_ = S.copy()

	ans.append(S_.pop(0))

	while S_ != []:

		if i.pop(0) == "1":

			ans.append("+")

		ans.append(S_.pop(0))

		#print(ans)

	anss.append(eval("".join(ans)))

#print(anss)

print((sum(anss)))
import sys, re

from collections import deque, defaultdict, Counter

from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2

from itertools import accumulate, permutations, combinations, product, groupby

from operator import itemgetter, mul

from copy import deepcopy

from string import ascii_lowercase, ascii_uppercase, digits

from bisect import bisect, bisect_left

from fractions import gcd

from heapq import heappush, heappop

from functools import reduce

import numpy as np

def input(): return sys.stdin.readline().strip()

def INT(): return int(eval(input()))

def MAP(): return list(map(int, input().split()))

def LIST(): return list(map(int, input().split()))

def ZIP(n): return list(zip(*(MAP() for _ in range(n))))

sys.setrecursionlimit(10 ** 9)

INF = float('inf')

mod = 10 ** 9 + 7

 

S = list(eval(input()))



l = len(S)

ans = []



for i in range(1<<l-1):

	anss = []

	i = list("{:b}".format(i).zfill(l-1))

	SS = S.copy()

	anss.append(SS.pop(0))

	while SS != []:

		if i.pop(0) == "1":

			anss.append("+")

		anss.append(SS.pop(0))



	ans.append(eval("".join(anss)))





print((sum(ans)))

import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np


def input():
    return sys.stdin.readline().strip()


def INT():
    return int(eval(input()))


def MAP():
    return list(map(int, input().split()))


def LIST():
    return list(map(int, input().split()))


def ZIP(n):
    return list(zip(*(MAP() for _ in range(n))))


sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7
S = list(eval(input()))
l = len(S)
anss = []
for i in range(1 << l - 1):
    ans = []
    i = list("{:b}".format(i).zfill(l - 1))
    # print(i)
    S_ = S.copy()
    ans.append(S_.pop(0))
    while S_ != []:
        if i.pop(0) == "1":
            ans.append("+")
        ans.append(S_.pop(0))
        # print(ans)
    anss.append(eval("".join(ans)))
# print(anss)
print((sum(anss)))

import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np


def input():
    return sys.stdin.readline().strip()


def INT():
    return int(eval(input()))


def MAP():
    return list(map(int, input().split()))


def LIST():
    return list(map(int, input().split()))


def ZIP(n):
    return list(zip(*(MAP() for _ in range(n))))


sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7
S = list(eval(input()))
l = len(S)
ans = []
for i in range(1 << l - 1):
    anss = []
    i = list("{:b}".format(i).zfill(l - 1))
    SS = S.copy()
    anss.append(SS.pop(0))
    while SS != []:
        if i.pop(0) == "1":
            anss.append("+")
        anss.append(SS.pop(0))
    ans.append(eval("".join(anss)))
print((sum(ans)))

-anss = [] +ans = [] -    ans = [] +    anss = [] -    # print(i) -    S_ = S.copy() -    ans.append(S_.pop(0)) -    while S_ != []: +    SS = S.copy() +    anss.append(SS.pop(0)) +    while SS != []: -            ans.append("+") -        ans.append(S_.pop(0)) -        # print(ans) -    anss.append(eval("".join(ans))) -# print(anss) -print((sum(anss))) +            anss.append("+") +        anss.append(SS.pop(0)) +    ans.append(eval("".join(anss))) +print((sum(ans)))