#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

constexpr int P = 1000000007;

ll powmod(ll n, ll k) {
    ll r = 1, t = n % P;
    for (; k != 0; k /= 2) {
        if (k & 1) r = r * t % P;
        t = t * t % P;
    }
    return r;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (a[i] == 0) {
            cout << 0 << endl;
            exit(0);
        }
    }

    vector<int> s(n + 1, 0), l(n);
    ll t = 1;
    for (int i0 = 0, i1 = 0; i0 < n;) {
        while (i1 < n && t * a[i1] < (ll)1e+9) t *= a[i1++];
        l[i0] = i1 - i0;
        s[i0]++;
        s[i1]--;
        t /= a[i0++];
    }

    ll r = 1;
    ll s1 = 0, l1 = 0;
    for (int i = 0; i < n; i++) {
        l1 += l[i];
        s1 += s[i];
        (r *= powmod(a[i], l1)) %= P;
        l1 -= s1;
    }

    cout << r << endl;

    return 0;
}