import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int N = in.nextInt();
            String c[] = new String[N];
            int plus=0;
            int minus=0;
            int num[] = new int[N];
            Arrays.fill(num,-1);

            for(int i=0; i<N; i++){
                c[i] = in.next();
                if(c[i].equals("+")){
                    plus++;
                }
                else if(c[i].equals("-")){
                    minus++;
                }
                else{
                    num[i]=Integer.parseInt(c[i]);
                }
            }

            Arrays.sort(num);

            int item = 2*(plus+minus);

            long maxnum=0;
            long pow=1;
            int pownum=0;

            for(int i=N-item; i>0; i--){
                pow=1;
                for(int j=0; j<pownum; j++){
                    pow = pow*10;
                }
                maxnum = maxnum+num[N-i]*pow;
                pownum++;
            }

            long maxres = maxnum;

            for(int i=0; i<plus; i++){
                maxres+=num[item-1-i];
            }
            for(int i=0; i<minus; i++){
                maxres-=num[item-1-plus-i];
            }

            long minres=0;
            int flag=0;
            for(int i=0; i<item; i++){
                if(num[i]==-1) continue;
                else{
                    if(flag==0){
                        flag=1;
                        minres=num[i];
                        continue;
                    }
                    if(plus>0){
                        minres+=num[i];
                        plus--;
                    }
                    else if(minus>0){
                        minres-=num[i];
                        minus--;
                    }
                }
            }
            if(plus>0) minres+=maxnum;
            if(minus>0) minres-=maxnum;

            out.print(maxres+" "+minres);
            out.println();


        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}