#10005. 「一本通 1.1 练习 1」数列极差

#include<bits/stdc++.h>
using namespace std;
class Solution{
	public:
		int solve(priority_queue < int > p,priority_queue < int > q)
		{
			int n=p.size();
			for(int i=1,x,y,z; i<n; i++)
			{
				x=p.top();
				p.pop();
				y=p.top();
				p.pop();
				z=x*y+1;
				p.push(z);
				
				
				x=q.top();
				q.pop();
				y=q.top();
				q.pop();
				z=x*y+1;
				q.push(-z);
			}
			return abs(p.top()+q.top());
		}
};
int main()
{
	int n;
	cin>>n;
	Solution x;
	priority_queue < int > p;
	priority_queue < int > q;
	for(int i=1; i<=n; i++)
	{
		int y;cin>>y;
		p.push(y);
		q.push(-y);
	}
	cout<<x.solve(p,q);
}