#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

ll p2(ll n, ll k) {
  ll result = 1;
  ll p2 = 0, now = n;
  while (k>=1ll<<p2) {
    if (k&1ll<<p2) result = result*now % MOD;
    p2++;
    now = now*now % MOD;
  }
  return result;
}

int main() {
  ll N; cin >> N;
  ll A[N]; rep(i,N) cin >> A[i];
  bool zero = false; rep(i,N) zero |= A[i]==0;
  if (zero) { cout << 0 << endl; return 0; }

  ll count_a[N+2] = {}, r = 0, mul = 1;
  ll MA = pow(10,9);
  rep(l,N) {
    while (r!=N&&mul*A[r]<MA) { mul*=A[r]; r++; }
    count_a[l] += r-l; count_a[l+1] -= r-l+1; count_a[r+1] += 1;
    if (l!=r) mul/=A[l];
    else r++;
  }
  ll count_v[N+1] = {}; rep(i,N+1) count_v[i] = i==0 ? count_a[i] : count_v[i-1] + count_a[i];
  ll count[N] = {}; rep(i,N) count[i] = i==0 ? count_v[i] : count[i-1] + count_v[i];
  // debug(count,count+N);

  ll result = 1; rep(i,N) result = result*p2(A[i],count[i]) % MOD;
  cout << result << endl;
  return 0;
}