#include <bits/stdc++.h> using namespace std; int a[10005]; priority_queue <int, vector <int>, greater <int> > q1; priority_queue <int> q2; int main (){ int n, sum = 0; cin >> n; for (int i=1; i<=n; i++){ cin >> a[i]; q1.push(a[i]); q2.push(a[i]); } while (q1.size() > 1){ int x = q1.top(); q1.pop(); int y = q1.top(); q1.pop(); int z = x * y + 1; q1.push(z); int a = q2.top(); q2.pop(); int b = q2.top(); q2.pop(); int q = a * b + 1; q2.push(q); } int maxx = q2.top(); int minx = q1.top(); cout << maxx - minx; return 0; }