from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    n=II()
    cc=input().split()
    cp=cm=0
    dig=[]
    for c in cc:
        if c=="+":cp+=1
        elif c=="-":cm+=1
        else:dig.append(c)
    dig_n=len(dig)
    dig.sort()
    if cm==0:
        num_n = cp + 1
        big_n=dig_n%num_n
        num=[""]*num_n
        for i in range(big_n):
            num[i]+=dig[i]
        for i in range(dig_n-big_n):
            num[i%num_n]+=dig[big_n+i]
        #print(num)
        num=list(map(int,num))
        mn=sum(num)
        num=[""]*num_n
        for i in range(num_n-1):
            num[i]=dig[i]
        s="".join(dig[num_n-1:])
        num[-1] =s[::-1]
        #print(num)
        num=list(map(int,num))
        mx=sum(num)
    else:
        num_n=cp+cm+1
        num=[""]*num_n
        for i in range(num_n-1):
            num[i]=dig[i]
        s="".join(dig[num_n-1:])
        num[-1] =s[::-1]
        #print(num)
        num=list(map(int,num))
        for i in range(cm):
            num[i]*=-1
        mx=sum(num)
        for i in range(cm):
            num[i]*=-1
        for i in range(-1,-1-cm,-1):
            num[i]*=-1
        mn=sum(num)
    print(mx,mn)

main()