#include <iostream> #include <algorithm> using namespace std; int a[500100], b[500100]; int main() { int n; cin >> n; while(n) { for(int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); for(int i = 1; i <= n; i++) b[i] = a[i]; int maxn = 0, minn = 0; for(int i = 2; i <= n; i++) { int t = a[i] * a[i - 1] + 1; a[i - 1] = a[i] = 0; a[i] = t; } for(int i = n - 1; i >= 1; i--) { int t = b[i] * b[i + 1] + 1; b[i] = b[i + 1] = 0; b[i] = t; } maxn = a[n]; minn = b[1]; cout << maxn - minn << endl; cin >> n; } return 0; }