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

#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
#define bit(n, k) ((n >> k) & 1)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18;
const double pi = acos(-1);

using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>;
using PQ = priority_queue<ll>;

//typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;

const int SIZE = 200010;

ll powll(ll n, ll x) {
    // return n ^ x;

    ll ret = 1;
    rep(i, x) ret *= n;

    return ret;
}

struct Edge { ll u, v, cost; };

bool comp(const Edge& e1, const Edge& e2) {
    return e1.cost < e2.cost;
}

int target = 0;
int op1(int a, int b) { return max(a, b); }
int e1() { return -1; }
bool f1(int v) { return v < target; }
int op2(int a, int b) { return min(a, b); }
int e2() { return -1; }
bool f2(int v) { return v > target; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    sort(rall(a));
    multiset<ll> se;
    rep(i, n) se.insert(a[i]);

    int i = 0;
    ll x, y;
    while(SZ(se) > 1){
        if(i % 2 == 0){
            auto it = se.begin();
            x = *it;
            se.erase(it);
            it = se.begin();
            y = *it;
            se.erase(it);
            se.insert(x * y);
        }else{
            auto it = se.end();
            it--;
            se.erase(it);
            it = se.end();
            it--;
            se.erase(it);
            se.insert(1);
        }
        i++;
    }
    cout << *se.begin() << endl;
}