#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))

#define MOD 1000000007

int main(){
  int n;
  cin>>n;
  vector<int> v;
  int minus = 0;
  int plus = 1;
  rep(i,0,n){
    string s;
    cin>>s;
    if(s=="-")minus++;
    else if(s=="+")plus++;
    else{
      v.pb(s[0]-'0');
    }
  }
  vector<int> vp;
  rep(i,0,plus){
    vp.pb(1);
  }
  rep(i,0,minus){
    vp.pb(-1);
  }
  sort(all(v));
  long long mn = 1000000000000LL;
  long long mx = -1000000000000LL;
  do{
    vector<int> vv;
    rep(i,0,v.sz){
      vv.pb(0);
    }
    rep(i,0,vp.sz-1){
      vv.pb(1);
    }
    do{
      vector<int> vvv;
      int a = -1;
      int index = 0;
      rep(i,0,vv.sz){
        if(vv[i] == 0){
          if(a==-1){
            a = v[index];
            index++;
          }
          else{
            a = a*10+v[index];
            index++;
          }
        }
        else{
          if(a!=-1)vvv.pb(a);
          a = -1;
        }
      }
      if(a!=-1)vvv.pb(a);
      if(vvv.sz==vp.sz){
        long long ans = 0;
        rep(i,0,vp.sz){
          ans += vp[i]*vvv[i];
        }
        mx = max(mx,ans);
        mn = min(mn,ans);
      }
    }while(next_permutation(all(vv)));
  }while(next_permutation(all(v)));
  cout << mx << " " << mn << endl;
  return 0;
}