#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
int main()
{
    int n; cin>>n;
    ll c[100010]={};
    ll d[100010]={};
    ll a[100010];
    for(int i=0; i<n; i++){
        cin>>a[i];
        if(a[i]==0){
            cout<<0<<endl;
            return 0;
        }
    }
    int r=-1;
    ll p=1;
    const ll MAX=1e9;
    ll x=0, s=0;
    ll ans=1;
    for(int l=0; l<n; l++){
        while(p<MAX && r<n){
          r++;
            p*=a[r];
        }
      p/=a[l];
      //cout<<l<<r<<endl;
        d[l]+=(r-l);
        c[l+1]--; c[r+1]++;
    }
    for(int i=1; i<=n+1; i++) c[i]+=c[i-1];
    for(int i=0; i<=n+1; i++) c[i]+=d[i];
    for(int i=0; i<n; i++){
        if(i) c[i]+=c[i-1];
        (ans*=powmod(a[i], c[i]))%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}