#include <iostream>
#include <algorithm>
using namespace std;
int minn = 0, maxx = 0;
int n;
int a[7];
void Fmin(int x, int y, int b) {
    if (b == n) {
        minn = x * y;
        return;
    }
    if (b == 0) Fmin(x + a[b], y, b + 1);
    else Fmin(x, y + a[b], b + 1);
}
void Fmax(int x, int y, int b) {
    if (b == n) {
        maxx = x * y;
        return;
    }
    if (b % 2 == 0) Fmax(x + a[b], y, b + 1);
    else Fmax(x, y + a[b], b + 1);
}
int main() {
    setlocale(0, "Rus");
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    Fmin(0,0,0);
    Fmax(0,0,0);
    cout << minn << " " << maxx << endl;
    system("pause");
    return 0;
}