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

int main() {
    int n;cin>>n;
    char a[n];
    for (int i=0;i<n;i++)
        cin>>a[i];
    sort(a,a+n);
    ll mn=1e18;
    ll mx=-1e18;
    do {
        if (!isdigit(a[0])||!isdigit(a[n-1]))
            continue;
        ll b=0;
        int i=0;
        while (i<n&&isdigit(a[i])) {
            b*=10;
            b+=a[i]-'0';
            i++;
        }
        bool invld=false;
        while (i<n) {
            int sign=1;
            if (a[i]=='-')
                sign=-1;
            i++;
            if (!isdigit(a[i])) {
                invld=true;
                break;
            }
            ll c=0;
            while (i<n&&isdigit(a[i])) {
                c*=10;
                c+=a[i]-'0';
                i++;
            }
            b+=c*sign;
        }
        if (invld)
            continue;
        mn=min(mn,b);
        mx=max(mx,b);
    } while (next_permutation(a,a+n));
    cout<<mx<<' '<<mn<<endl;
    return 0;
}