/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.20 03:12:32
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

constexpr int MOD = 1e9 + 7;
struct mint {
private:
    long long x;
public:
    mint(long long x = 0) :x((MOD+x)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
};
template<typename T, typename U>
T pow(T k, U n, T unity = 1) {
    while (n > 0) {
        if (n & 1) {
            unity *= k;
        }
        k *= k;
        n >>= 1;
    }
    return unity;
}
int main() {
    int n;cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (a[i] == 0) {
            cout << 0 << endl;
            return 0;
        }
    }
    vector<ll> sum(n);
    int r = 0;
    ll total = 1;
    for (int l = 0; l < n; l++) {
        while(r < n && total * a[r] < 1000000000) {
            total *= a[r];
            r++;
        }
        sum[r-1] += 1;
        if (l-1 >= 0) sum[l-1] += -(r-l+1);
        if (l-2 >= 0) sum[l-2] += r-l;
        total /= a[l];
    }
    for (int i = n-2; i >= 0; i--) {
        sum[i] += sum[i+1];
    }
    for (int i = n-2; i >= 0; i--) {
        sum[i] += sum[i+1];
    }
    mint ans = 1;
    for (int i = 0; i < n; i++) {
        ans *= pow(mint(a[i]),sum[i]);
    }
    cout << ans << endl;
    return 0;
}