#include <bits/stdc++.h>
using namespace std;
int main(){
    int N;
    cin >> N;
    vector<long long> A(N);
    for(int i = 0; i < N; i++) cin >> A[i];
    sort(A.begin(), A.end());
    if(N == 1){
        cout << A[0] << endl;
    }
    else if(N == 2){
        cout << A[0] * A[1] << endl;
    }
    else{
        if(N % 2 == 0){
            multiset<long long> s;
            for(int i = 0; i < N; i++) s.insert(A[i]);
            int temp = N - 1;
            bool f = true;
            while(temp--){
                if(f){
                    auto ite = s.begin();
                    auto ne = next(ite);
                    long long te = *ite * *ne;
                    long long t = *ite;
                    long long t2 = *ne;
                    s.erase(s.find(t));
                    s.erase(s.find(t2));
                    s.insert(te);
                }
                else{
                    auto ite = s.rbegin();
                    auto ne = ite;
                    ne++;
                    long long t = *ite;
                    long long t2 = *ne;
                    s.erase(s.find(t));
                    s.erase(s.find(t2));
                    s.insert(1);
                }
                f = !f;
            }
            cout << *s.begin() << endl;
        } 
        else{
            cout << 1 << endl;
        }
    }
}