#include <bits/stdc++.h>
using namespace std;
int main() {
  int n; cin>>n;
  vector<int> a(n);
  for (auto& x : a) cin>>x;
  multiset<int> ms(a.begin(), a.end());
  for (int i = 0; i < n-1; ++i) {
      assert(ms.size() >= 2);
      if (i & 1) {
          // Bob's turn
          int x1 = *prev(ms.end());
          ms.erase(prev(ms.end()));
          int x2 = *prev(ms.end());
          ms.erase(prev(ms.end()));
          ms.insert((x2 + x1 - 1)/x1);
      } else {
          // Alice's turn
          int xl = *ms.begin();
          int xr = *prev(ms.end());
          ms.erase(ms.begin());
          ms.erase(prev(ms.end()));
          ms.insert(xl*xr);
      }
  }
  assert(ms.size() == 1);
  cout << *ms.begin() << endl;
}