#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;


typedef vector<complex<double>> poly;
const double pi=acos(-1);

poly dft(poly f,int rev){
   int n=f.size();
   int j=0;
   REP(i,1,n-1){
      for(int k=n/2;k>(j^=k);k>>=1);
      if(i<j)swap(f[i],f[j]);
    }
   complex<double> zeta,ret,t,s;
   for(int i=1;i<n;i<<=1){
      zeta=polar(1.0,pi/i*rev);
      for(int j=0;j<n;j+=2*i){
         ret=1.0;
         rep(k,i){
              s=f[j+k];
              t=f[j+k+i];
              t=complex<double>(t.real()*ret.real()-t.imag()*ret.imag(),t.imag()*ret.real()+t.real()*ret.imag());
              f[j+k]=s+t;
              f[j+k+i]=s-t;
              ret*=zeta;
          }
       }
   }
    if(rev==-1)rep(i,n)f[i]/=n;
    return f;
}

poly fft(poly g,poly h){
   poly f;
   int m=(int)g.size()+h.size()+1;
   int sz=1;
   while(sz<m)sz*=2;
   f.resize(sz,0);
   g.resize(sz,0);
   h.resize(sz,0);
   g=dft(g,1);
   h=dft(h,1);
   rep(i,sz)f[i]=g[i]*h[i];
   f=dft(f,-1);
   return f;
}

ll powmod(ll n,ll k){
    k%=mod-1;
    if(k<0)k+=mod-1;
    ll ret=1;
    while(k){
        if(k&1)ret=ret*n%mod;
        n=n*n%mod;
        k>>=1;
    }
    return ret;
}
int main(){
    int n;
    cin>>n;
    ll a[n];
    rep(i,n)cin>>a[i];
    poly f(100001);
    rep(i,n)f[a[i]]+=1;
    poly res = fft(f,f);
    rep(i,n){
        res[2*a[i]]-=1.0;
    }
    ll ans = 1;
    rep(i,200001){
        ans*=powmod(i,(ll)(res[i].real()+.5)/2);
        ans%=mod;
    }
    ll sum = 0;
    ll mi = inf;
    vector<pair<double,double>> v;
    for(int i=n-1;i>=0;i--){
        ans*=powmod(a[i],sum);
        ans%=mod;
        sum+=a[i];
        v.emplace_back(a[i],mi);
        mi=min(a[i],mi);
    }
    sort(v.begin(),v.end(),[](auto x,auto y){
        return log(x.first)*x.second+log(x.first+x.second)<log(y.first)*y.second+log(y.first+y.second);
    });
    ans*=powmod(v[0].first+v[0].second,mod-2);
    ans%=mod;
    ans*=powmod(v[0].first,mod-1-v[0].second);
    ans%=mod;
    cout<<ans<<endl;
    return 0;
}