#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector vi; typedef pair pii; typedef vector > vpii; typedef long long ll; template inline void amin(T &x, U y) { if(y < x) x = y; } template inline void amax(T &x, U y) { if(x < y) x = y; } int main() { int N; while(~scanf("%d", &N)) { vi digits; int plus = 0, minus = 0; rep(i, N) { char c[2]; scanf("%s", c); if(isdigit(*c)) { digits.push_back(*c - '0'); } else if(*c == '+') { ++ plus; } else if(*c == '-') { ++ minus; } } ll maxi; sort(all(digits)); reverse(all(digits)); int d = (int)digits.size(); ll maxnum = 0; int rem = d - (plus + minus); rep(i, rem) maxnum = maxnum * 10 + digits[i]; maxi = 0; maxi += maxnum; rep(i, plus) maxi += digits[rem + i]; rep(i, minus) maxi -= digits[rem + plus + i]; ll mini; if(minus > 0) { mini = 0; rep(i, plus + 1) mini += digits[d - 1 - i]; rep(i, minus - 1) mini -= digits[d - 1 - plus - 1 - i]; mini -= maxnum; } else { mini = 0; ll p10 = 1; rep(i, digits.size()) { mini += digits[i] * p10; if(i == plus) p10 *= 10; } } printf("%lld %lld\n", maxi, mini); } return 0; }