import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    n = input()
    cc = input().split()
    # 文字を+,-,数字に分ける
    # 式の先頭は+がなくとも正の数になるので+は1つカウントしておく
    p = 1
    m = 0
    dig = []
    for c in cc:
        if c == "+": p += 1
        elif c == "-": m += 1
        else: dig.append(c)
    dig.sort(reverse=True)
    # print(p,m,dig)
    # 数字を降順にソートして1つだけ大きな数を作る
    sep = len(dig) - p - m + 1
    num = [int("".join(dig[:sep]))]
    num += [int(c) for c in dig[sep:]]
    # print(num)
    # 先頭から順に+にしたものが最大、-にしたものが最小
    mx = sum(num[:p]) - sum(num[p:])
    mn = -sum(num[:m]) + sum(num[m:])
    print(mx, mn)

main()