#include <iostream> #include <queue> #include <algorithm> #define int long long using namespace std; priority_queue<int> qma; priority_queue<int, vector<int>, greater<int> > qmi; signed main() { int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; qma.push(x); qmi.push(x); } while (qma.size() != 1) { int a(qma.top()); qma.pop(); int b(qma.top()); qma.pop(); qma.push(a * b + 1); } while (qmi.size() != 1) { int a(qmi.top()); qmi.pop(); int b(qmi.top()); qmi.pop(); qmi.push(a * b + 1); } cout << qmi.top() - qma.top(); }