#include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1000000007;

template <int mod>
struct ModInt{
  int n;
  ModInt():n(0){}
  ModInt(long long n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}
  ModInt(int n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}

  ModInt &operator+=(const ModInt &p){
    if((n+=p.n) >= mod)n-=mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p){
    n+=mod-p.n;
    if(n >= mod)n-=mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p){
    n = (int) ((1LL*n*p.n)%mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p){
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const {return ModInt(-n);}
  ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;}
  ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;}
  ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;}
  ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;}

  bool operator==(const ModInt &p) const {return n==p.n;}
  bool operator<(const ModInt &p) const {return n<p.n;}
  bool operator>(const ModInt &p) const {return n>p.n;}
  bool operator>=(const ModInt &p) const {return n>=p.n;}
  bool operator<=(const ModInt &p) const {return n<=p.n;}
  bool operator!=(const ModInt &p) const {return n!=p.n;}

  ModInt inverse() const {
    int a = n,b = mod,u = 1,v = 0;
    while(b){
      int t = a/b;
      a -= t*b; swap(a,b);
      u -= t*v; swap(u,v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t z) const {
    ModInt ret(1),mul(n);
    while(z > 0){
      if(z & 1) ret *= mul;
      mul *= mul;
      z >>= 1;
    }
    return ret;
  }

  int getMod() const {
    return mod;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p){
    return os << p.n;
  }
  friend istream &operator>>(istream &is, ModInt &a){
    int64_t t;
    is >> t;
    a = ModInt<mod> ((long long)t);
    return (is);

  }
};
using mint = ModInt<MOD>;

template <typename T>
T uPow(T z,T n, T mod){
  T ans = 1;
  while(n != 0){
    if(n%2){
      ans*=z;
      if(mod)ans%=mod;
    }
    n >>= 1;
    z*=z;
    if(mod)z%=mod;
  }
  return ans;
}

int main(){
  int n;cin>>n;
  vector<long long> A(n);
  vector<mint> rA(n+1, 1);
  vector<mint> rrA(n+1, 1);

  for(int i = 0; n > i; i++){
    cin>>A[i];
    if(A[i] == 0){
      cout << 0 << endl;
      return 0;
    }
  }
  for(int i = 1; n >= i; i++){
    rA[i] = rA[i-1]*A[i-1];
  }
  for(int i = 1; n >= i; i++){
    rrA[i] = rrA[i-1] * uPow(A[i-1], (long long)i, MOD);
  }
  
  long long nw = 1;
  int prev = 0;
  mint ans = 1;
  for(int i = 0; n > i; i++){
    nw *= A[i];
    while(nw >= 1000000000){
      nw /= A[prev];
      prev++;
    }
    //cout << prev << " " << i << endl;
    if(prev){
      //cout << (rrA[i+1] / rrA[prev]) << " " << (rA[i+1]/rA[prev]) << " "  << (prev) << endl;
      //cout << (rrA[i+1] / rrA[prev])/((rA[i+1]/rA[prev])*(prev)) << endl;
      ans *= (rrA[i+1] / rrA[prev])/((rA[i+1]/rA[prev]).pow(prev));
    }else{
      //cout << (rrA[i+1] / rrA[prev]) << endl;
      ans *= (rrA[i+1] / rrA[prev]);
  }

  }
  cout << ans << endl;
}