#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll get_max( const vector< int > &dig, int st ){
  ll res = 0;
  for( int i = dig.size() - 1; i >= st; --i )
    res = res * 10 + dig[ i ];
  return res;
}

signed main(){
  int N; cin >> N;
  vector< string > C( N );
  for( int i = 0; i < N; ++i )
    cin >> C[ i ];
  vector< int > dig;
  int pcnt = 0, mcnt = 0;
  for( int i = 0; i < N; ++i ){
    pcnt += C[ i ][ 0 ] == '+';
    mcnt += C[ i ][ 0 ] == '-';
    if( '0' <= C[ i ][ 0 ] and C[ i ][ 0 ] <= '9' )
      dig.emplace_back( C[ i ][ 0 ] - '0' );
  }
  // for( int i = 0; i < dig.size(); ++i ) cout << dig[ i ] << " \n"[ i + 1 == dig.size() ];
  ll ans1 = 0, ans2 = 0;
  sort( dig.begin(), dig.end() );
  int ptr = 0;
  for( int i = 0; i < mcnt; ++i )
    ans1 -= dig[ ptr++ ];
  for( int i = 0; i < pcnt; ++i )
    ans1 += dig[ ptr++ ];
  ans1 += get_max( dig, ptr );
  if( mcnt ){
    ptr = 0;
    for( int i = 0; i < pcnt + 1; ++i )
      ans2 += dig[ ptr++ ];
    for( int i = 0; i < mcnt - 1; ++i )
      ans2 -= dig[ ptr++ ];
    ans2 -= get_max( dig, ptr );
  } else{
    ptr = dig.size() - 1;
    int len = ( dig.size() + pcnt ) / ( pcnt + 1 );
    ll pw = 1;
    for( int i = 0; i < len; ++i, pw *= 10 ){
      int x = pcnt + ( not ( ( ptr + 1 ) / ( len - i ) == pcnt and ( ptr + 1 ) % ( len - i ) == 0 ) );
      for( int j = 0; j < x; ++j )
        ans2 += pw * dig[ ptr-- ];
    }
  }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}