#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int n;
    cin >> n;
    vi a(n);
    rep(i, n) cin >> a[i];
    if (n == 1) {
        cout << a[0] << endl;
        return 0;
    }
    if (n == 2) {
        cout << a[0] * a[1] << endl;
        return 0;
    }
    priority_queue<int> pq;
    rep(i, n) { pq.push(a[i]); }
    bool Alice = true;
    int turn = 1;
    while (turn <= n - 1) {
        if (Alice) {
            // Alice
            auto x = pq.top();
            pq.pop();
            auto y = pq.top();
            pq.pop();
            pq.push(x * y);
        } else {
            // Bob
            auto x = pq.top();
            pq.pop();
            auto y = pq.top();
            pq.pop();
            int r = y / x;
            pq.push(r);
        }
        Alice ^= 1;
        turn++;
    }
    auto ans = pq.top();
    cout << ans << endl;
}