#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<long long> v;
  int minus = 0;
  int plus = 0;
  rep(i,0,n){
    string s;
    cin>>s;
    if(s=="-")minus++;
    else if(s=="+")plus++;
    else{
      v.pb(s[0]-'0');
    }
  }
  vector<long long> vp;
  rep(i,0,minus){
    vp.pb(-1);
  }
  rep(i,0,plus){
    vp.pb(1);
  }
  sort(all(v));
  vector<long long> vv;
  int index = 0;
  rep(i,0,vp.sz){
    vv.pb(v[i]);
    index++;
  }
  long long a = 0;
  rep(i,0,v.sz-index){
    a += v[i+index]*pow(10,i);
  }
  vv.pb(a);
  sort(all(vv));
  vp.pb(1);
  long long mx = 0;
  long long mn = 0;
  sort(all(vp));
  rep(i,0,vp.sz){
    mx += vp[i]*vv[i];
  }
  reverse(all(vp));
  rep(i,0,vp.sz){
    mn += vp[i]*vv[i];
  }
  if(minus==0){
    long long mn2 = 0;
    sort(all(v));
    reverse(all(v));
    rep(i,0,v.sz){
      mn2 += v[i]*pow(10,i/vp.sz);
    }
    mn = min(mn,mn2);
  }
  cout << mx << " " << mn << endl;
  return 0;
}