#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int N; while(cin >> N && N != 0) { priority_queue <int , vector<int> , greater<int> > q1; priority_queue <int , vector<int> , less<int> > q2; int n = 1; for(int i = 1;i <= N;i++) { int n; cin >> n; q1.push(n); q2.push(n); } for(int i = 1;i <= N - 1;i++) { int n1 = q1.top(); q1.pop(); int n2 = q1.top(); q1.pop(); q1.push(n1*n2+1); n1 = q2.top(); q2.pop(); n2 = q2.top(); q2.pop(); q2.push(n1*n2+1); } cout << q1.top() - q2.top() << endl; } }