#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#pragma warning(disable:4996) 

typedef long long ll;
typedef unsigned long long ull;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;


ll mpow(ll x, ll n){ //x^n(mod M)
    ll ans = 1;
    while(n != 0){
        if(n&1) ans = ans*x % MOD;
        x = x*x % MOD;
        n = n >> 1;
    }
    return ans;
}

ll minv(ll x){
    return mpow( x, MOD-2 );
}

const int M = 1000000000;
void solve()
{
    int n;
    scanf("%d", &n);
    vector<int> a(n);
    int i,j;
    for (i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }

    int stt = 0;
    for (i = 0; i < n; i++) {
        if (a[i] == 0) {
            printf("0\n"); return;
        }
    }

    vector<ll> s(n + 1, 1);
    for (i = 0; i < n; i++) {
        s[i + 1] = s[i] * a[i] % MOD;
    }
    vector<ll> ss(n + 2, 1);
    for (i = 0; i < n+1; i++) {
        ss[i + 1] = ss[i] * s[i] % MOD;
    }

    ll ans = 1;
    ll sum = 1;
    int r = 0;
    for (i = 0; i < n; i++) {
        if (r <= i) {
            r = i;
            sum = a[i];
        }
        else if (i > 0) {
            sum /= a[i-1];
        }
        while (r+1 < n && sum*a[r+1]<M) {
            sum = sum * a[r + 1];
            r++;
        }
        //printf("%d,%d,%lld\n", i, r, sum);
        ll ans0 = ss[r + 2] * minv(ss[i+1]) %MOD;
        if (i > 0) {
            ans0 = ans0 * minv(mpow(s[i], r-i+1)) % MOD;
        }
        ans = ans * ans0%MOD;
    }
    printf("%lld\n", ans);

    return;
}


int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for(t=0; t<T; t++) {
        //printf("Case #%d: ", t+1);
        solve();
    }
#endif
    return 0;
}