#include <stdio.h>
#include <functional>
#include <algorithm>
#include <cmath>
#define qaq inline
const int sz=1e5+19;
using ll=long long;
int n;
ll ans=0,arr[sz];
int main(){
  scanf("%d",&n);
  for(int cx=0;cx<n;++cx)
    scanf("%d",arr+cx);
  if(n==1) return printf("%d\n",arr[0]);
  std::sort(arr,arr+n,std::greater<int>());
  int p1=0,p2=n-1,flag=1;
  while(p1<p2){
    if(flag) ans=arr[p1]=1LL*arr[p1]*arr[p2],p2--;
    else ans=arr[p2]=std::ceil(arr[p2]*1.0/arr[p1]),p1++;
    flag^=1;
  }
  printf("%lld",ans);
  return 0;
}