import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N = I()
C = LS()

plus,minus = 0,0
A = []
for c in C:
    if c == '+':
        plus += 1
    elif c == '-':
        minus += 1
    else:
        A.append(c)
symbol = plus+minus

A.sort(reverse=True)
a = int(''.join(A[:N-2*symbol]))

M = a  # 最大値
for i in range(plus):
    M += int(A[N-2*symbol+i])
for i in range(minus):
    M -= int(A[N-2*symbol+plus+i])

m = 0  # 最小値
if minus:
    m = -a
    minus -= 1
    plus += 1
    for i in range(minus):
        m -= int(A[N-2*symbol+i])
    for i in range(plus):
        m += int(A[N-2*symbol+minus+i])
else:
    q,r = divmod(N-symbol,symbol+1)
    A.reverse()
    if r != 0:
        for i in range(r):
            m += int(A[i])*10**q
    for i in range(q):
        for j in range(r+(symbol+1)*i,r+(symbol+1)*(i+1)):
            m += int(A[j])*10**(q-1-i)

print(M,m)