#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 1000000007;

int main() {
    int N;
    cin >> N;
    vector <ll> A(N);
    multiset<ll> st;
    REP(i, N) {
        cin >> A[i];
        st.insert(-A[i]);
    }
    REP(i, N - 1) {
        ll x = -*st.begin();
        st.erase(st.find(-x));
        ll y = -*st.begin();
        st.erase(st.find(-y));
        if (i % 2) {
            st.insert(-((y + x - 1) / x));
        } else {
            st.insert(-(x * y));
        }
    }
    cout << -*st.begin() << endl;
}