#include <stdio.h>
#include <algorithm>
#include <set>
#define qaq inline
const int sz=1e5+19;
using ll=long long;
int n,arr[sz];
std::multiset<ll> ms;
int main(){
  scanf("%d",&n);
  for(int cx=0,u;cx<n;++cx){
    scanf("%d",&u);
    ms.insert(u);
  }
  for(int cx=1;cx<n;++cx){
    if(cx&1){
      ll x=*ms.begin();
      ms.erase(ms.begin());
      ll y=*ms.begin();
      ms.erase(ms.begin());
      ms.insert(1LL*x*y);
    }else{
      ms.erase(--ms.end());
      ms.erase(--ms.end());
      ms.insert(1);
    }
  }
  printf("%lld\n",*ms.begin());
  return 0;
}