#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
vector<int> numbers;
vector<int> cal;
int sresult=1000000000;
int bresult=-1000000000;
int n;
int val;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> val;
numbers.push_back(val);
}
cin >> val;
for (int i = 0; i < val; i++)
cal.push_back(1);
cin >> val;
for (int i = 0; i < val; i++)
cal.push_back(2);
cin >> val;
for (int i = 0; i < val; i++)
cal.push_back(3);
cin >> val;
for (int i = 0; i < val; i++)
cal.push_back(4);
do {
val = numbers[0];
for (int i = 1; i < numbers.size(); i++) {
if (cal[i - 1] == 1)
val = val + numbers[i];
else if (cal[i - 1] == 2)
val = val - numbers[i];
else if (cal[i - 1] == 3)
val = val * numbers[i];
else if (cal[i - 1] == 4)
val = val / numbers[i];
}
if (val < sresult)
sresult = val;
if (val > bresult)
bresult = val;
val = 0;
} while (next_permutation(cal.begin(), cal.end()));
cout << bresult << endl;
cout << sresult << endl;
return 0;
}