import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto C = new string[N];
      foreach (i; 0 .. N) {
        C[i] = readToken();
      }
      
      auto ts = new int[N];
      long[] as;
      foreach (i; 0 .. N) {
        switch (C[i]) {
          case "+": {
            ts[i] = 1;
          } break;
          case "-": {
            ts[i] = 2;
          } break;
          default: {
            ts[i] = 0;
            as ~= C[i].to!long;
          }
        }
      }
      ts.sort;
      as.sort;
      long ansMin = long.max;
      long ansMax = long.min;
      do {
        bool ok = true;
        ok = ok && (ts[0] == 0);
        ok = ok && (ts[N - 1] == 0);
        foreach (i; 0 .. N - 1) {
          ok = ok && (ts[i] == 0 || ts[i + 1] == 0);
        }
        if (ok) {
          auto coef = new long[N];
          foreach_reverse (i; 0 .. N) {
            if (ts[i] == 0) {
              coef[i] = (i + 1 < N && ts[i + 1] == 0) ? (10 * coef[i + 1]) : 1;
            }
          }
          foreach (i; 1 .. N) {
            if (ts[i] == 0) {
              if (ts[i - 1] == 2 || coef[i - 1] < 0) {
                coef[i] *= -1;
              }
            }
          }
          debug {
            writeln(ts, ": ", coef);
          }
          long[] cs;
          foreach (i; 0 .. N) {
            if (ts[i] == 0) {
              cs ~= coef[i];
            }
          }
          cs.sort;
          long tmpMin, tmpMax;
          foreach (j, c; cs) {
            tmpMin += c * as[$ - 1 - j];
            tmpMax += c * as[j];
          }
          chmin(ansMin, tmpMin);
          chmax(ansMax, tmpMax);
        }
      } while (ts.nextPermutation);
      writeln(ansMax, " ", ansMin);
    }
  } catch (EOFException e) {
  }
}