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