#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 998244353;
const int inf = (1<<30);
const ll INF = (1ull<<62);

int main(){
    int n; cin>>n;
    vector<ll> a(n);

    rep(i,n) cin>>a[i];
    sort(a.begin(),a.end());
    if(n >= 3 && n%2 == 1) cout<<1<<endl;
    else if(n == 2){
        cout<<a[0]*a[1]<<endl;
    }else if(n == 1){
        cout<<a[0]<<endl;
    }else{
        ll ans = a[0]*a[1];
        rep(i,n-2) ans = min(ans,a[i+2]);
        cout<<ans<<endl;
    }
}