N = int(raw_input())
c = raw_input().split()
p = m = 0
inc = 0
while inc < N - p - m:
	if c[inc].isdigit():
		inc += 1
	elif c.pop(inc) == "+":
		p += 1
	else:
		m += 1
op = m + p
N -= op
c.sort(reverse = True)
max_v = int("".join(c[:N-op]))+sum(map(int,c[N-op:N-m]))-sum(map(int,c[N-m:]))
if m == 0:
	min_v = sum(int(c[i])*10**(i/(op+1)) for i in xrange(N))
else: 
	min_v = sum(map(int,c[N-(p+1):]))-sum(map(int,c[N-op:N-(p+1)]))-int("".join(c[:N-op]))
print max_v, min_v