#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>;  using Vi = vector<long long int>;
using P = pair<int, int>;  using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";}; 
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////

ll pow(ll x,ll y,ll mod){
    if(y==0) return 1;
    if(y&1) return x*pow(x,y-1,mod)%mod;
    ll p=pow(x,y/2,mod);
    return p*p%mod;
}

void solve(){
    int n;
    cin >> n;
    Vi a(n);
    bool z=false;
    rp(i,n) {
        cin >> a.at(i);
        if(a[i]==0) z=true;
    }
    if(z) {
        print(0);
        return;
    }
    ll pre=a[0];
    ll l=0,r=0;
    Vi num(n);
    while(l<n-1){
        if(pre>1000000000||r==n){
            pre/=a[l];
            num[l]=r-l;
            l++;
        }else{
            r++;
            if(r!=n)
            pre*=a[r];
        }
    }
    num[n-1]=1;
    ll ans=1;
    ll ctr=0;
    ll sub=0;
    p_queue(ll) pos;
    rp(i,n){
        ctr-=sub;
        ctr+=num[i];
        while(pos.size()&&pos.top()==i){
            pos.pop();
            sub--;
        }
        sub++;
        pos.push(i+num[i]);
        ans*=pow(a[i],ctr,Mod);
        ans%=Mod;
    }
    print(ans);
    return;
}
int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    std::cout<<std::fixed<<std::setprecision(30);
    solve();
    return 0;
}