#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

lint powmod(lint x, lint n){
    lint ret=1;
    while(n){
        if(n&1) (ret*=x)%=mod, --n;
        else (x*=x)%=mod, n>>=1;
    }
    return ret;
}

int main(){
    int n;
    cin>>n;
    lint a[n];
    rep(i,n) cin>>a[i];
    int cnt[n];
    memset(cnt,0,sizeof(cnt));
    int r=0;
    lint t=1, ans=1;
    rep(l,n){
        while(r<n && t<mod-7) ++r;
        if(r==n && t<mod-7) cnt[l]=r-l;
        else cnt[l]=r-l-1;
        t/=a[l];
        (ans*=powmod(a[l],cnt[l]))%=mod;
    }
    cout<<ans<<endl;
}