import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter, deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

S=list(readline().rstrip())
N=len(S)
lst=[]
for s in S:
    if s in '*+':
        lst.append(s)
for i in range(N):
    if S[i] in '*+':
        S[i]=' '
S=list(map(int,''.join(S).split()))
N=len(lst)
ans=S[0]
for i in range(N):
    if lst[i]=='+':
        ans*=S[i+1]
    else:
        ans+=S[i+1]
print(ans)