n = int(input())
s = input().split()
INF = 1<<30
N = 1<<n
dp1 = [-INF]*N
dp2 = [INF]*N
pm = []
pmmask = 0
for i in range(n):
    if s[i].isdigit():
        dp1[1<<i] = dp2[1<<i] = int(s[i])
    else:
        pm.append(i)
        pmmask |= 1<<i
for mask in range(N):
    j = (mask-1)&mask
    while j:
        if dp1[j] != -INF and dp1[mask^j] != -INF:
            dp1[mask] = max(dp1[mask],int(str(dp1[j])+str(dp1[j^mask])))
            dp2[mask] = min(dp2[mask],int(str(dp2[j])+str(dp2[j^mask])))
        j = (j-1)&mask
for mask in range(N):
    for i in pm:
        if mask>>i&1==0: continue
        nmask = mask^(1<<i)
        j = (nmask-1)&nmask
        while j:
            if j&pmmask:
                j = (j-1)&nmask
                continue
            if dp1[j] != -INF and dp1[nmask^j] != -INF:
                if s[i] == "+":
                    dp1[mask] = max(dp1[mask],dp1[j] + dp1[nmask^j])
                    dp2[mask] = min(dp2[mask],dp2[j] + dp2[nmask^j])
                else:            
                    dp1[mask] = max(dp1[mask], -dp2[j] + dp1[nmask^j])
                    dp2[mask] = min(dp2[mask], -dp1[j] + dp2[nmask^j])
            j = (j-1)&nmask
print(dp1[-1],dp2[-1])