#include<bits/stdc++.h>
using namespace std;

using ll = int64_t;
ll mod_pow(ll n,ll p,ll MOD){
  ll ans=1LL;
  while(p){
    if(p&1)ans*=n;
    n*=n;
    p>>=1;
    ans%=MOD;
    n%=MOD;
  }
  return ans;
}


signed main(){

  int n;
  cin>>n;
  vector a(n,0ll);
  for(auto& ai:a)cin>>ai;

  int64_t tmp = 1;
  const int64_t inf = 1e9;
  vector<int64_t> kl(n),kr(n);
  int l=0,r=0;
  for(;l<n;++l){
    while(r<n && tmp*a[r]<inf)tmp*=a[r++];
    kl[l] = r-l;
    tmp /= a[l];
  }
  reverse(begin(a),end(a));
  l=0,r=0;
  for(;l<n;++l){
    while(r<n && tmp*a[r]<inf)tmp*=a[r++];
    kr[l] = r-l;
    tmp /= a[l];
  }
  reverse(begin(kr),end(kr));
  reverse(begin(a),end(a));

  const int64_t MOD = 1e9+7;
  int64_t ans = 1;
  for(int i=0;i<n;++i){
    ans *= mod_pow(a[i],(kl[i]*kr[i]),MOD);
    ans %= MOD;
  }
  cout<<(ans)<<endl;


}