#include<bits/stdc++.h> using namespace std; priority_queue<int> qmax; priority_queue<int,vector<int>, greater<int> > qmin; long long n,a[50005]; int main() { while(1) { scanf("%lld",&n); if(n<=0) { return 0; } for(int i=1,temp;i<=n;++i) scanf("%lld",&temp),qmax.push(temp),qmin.push(temp); for(int i=1;i<n;++i) { int maxx=qmax.top(); qmax.pop(); maxx*=qmax.top(); qmax.pop(); qmax.push(maxx+1); int minn=qmin.top(); qmin.pop(); minn*=qmin.top(); qmin.pop(); qmin.push(minn+1); } printf("%lld\n",qmin.top()-qmax.top()); } return 0; }