#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

typedef long long ll;
typedef long double ld;

const ld eps = 1e-9, pi = acos(-1.0);

int parse(vector<string> str, int &p) {
  str.push_back("@");
  int N = str.size();
  int res = 0, tmp = 0;
  string sw = "+";
  REP(i,N) {
    if (isdigit(str[i][0])) tmp = tmp * 10 + stoi(str[i]);
    else {
      if (sw == "+") res += tmp;
      else res -= tmp;
      sw = str[i];
      tmp = 0;
    }
  }
  return res;
}

bool is_valid(const vector<string> &str) {
  int N = str.size();
  if (!isdigit(str[0][0])) return false;
  if (stoi(str[0]) == 0) return false;
  if (!isdigit(str[N-1][0])) return false;
  REP(i,N-1) if (!isdigit(str[i][0]) && !isdigit(str[i+1][0])) return false;
  return true;
}

int main() {
  int N; cin >> N;
  vector<string> str(N);
  REP(i,N) cin >> str[i];
  sort(ALL(str));
  int mi = 1e9, ma = -1e9;
  do {
    int p = 0;
    if (!is_valid(str)) continue;
    int num = parse(str, p);
    mi = min(mi, num);
    ma = max(ma, num);
  } while (next_permutation(ALL(str)));
  cout << ma << " " << mi << endl;
  return 0;
}