#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), p(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (a[i] == 0) {
            cout << 0 << endl;
            exit(0);
        }
    }

    int k = 0;
    for (int i = n - 1; i >= 0; i--) {
        p[i] = k;
        if (a[i] == 1) k++; else k = 0;
    }

    ll r = 1;
    for (int i = 0; i < n; i++) {
        ll t = 1;
        for (int j = i; j < n; j++) {
            t *= a[j];
            if (t >= (int)1e+9) break;

            int k = p[j];
            if (k == 0) {
                (r *= t) %= P;
            } else {
                (r *= powmod(t, k + 1)) %= P;
                j += k;
            }
        }
    }

    cout << r << endl;

    return 0;
}