#include using namespace std; using ll = long long; using V = vector; using VV = vector; using VVV = vector; using VVVV = vector; using VVVVV = vector; using VVVVVV = vector; using VS = vector; using VB = vector; using VVB = vector; using P = pair; using M = map; using Q = queue; using PQ = priority_queue; using PQG = priority_queue>; using S = set; using VP = vector

; const ll MOD = 1000000007; const ll mod = 998244353; const ll INF = 1LL << 60; #define rep(i,n) for(ll i = 0; i < n; i++) #define rep2(i,s,n) for(ll i = s; i < n; i++) #define per(i,n) for(ll i = n-1; i >= 0; i--) #define per2(i,s,n) for(ll i = n-1; i >= s; i--) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define fi first #define se second #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define eb emplace_back #define lb lower_bound #define ub upper_bound templatebool chmin(T&a, const T&b){if(a>b){a=b;return true;}return false;} templatebool chmax(T&a, const T&b){if(avoid Vin(vector&a){rep(i,(ll)a.size())cin>>a[i];} templatevoid VVin(vector>&a){rep(i,(ll)a.size())Vin(a[i]);} templatevoid Vout(const vector&a){rep(i,(int)a.size()-1)cout<void Voutl(const vector&a){rep(i,(int)a.size())cout<0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;} const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0}; int main() { ll n; cin >> n; V a(n); Vin(a); sort(rall(a)); rep(i,n-1) { if(i%2 == 0) a[0] *= a[i+1]; else a[0] = (a[0]+a[i+1]-1)/a[i+1]; } cout << a[0] << endl; }