#include <stdio.h>
#include <deque>
using namespace std;

const long long mod = 1000000007;
const long long lim = 1000000000;

long long fpow(long long a, long long p)
{
	long long r = 1;
	while (p){
		if (p & 1) r = r * a % mod;
		a = a * a % mod;
		p /= 2;
	}
	return r;
}

long long inv(long long a)
{
	return fpow(a, mod - 2);
}

int N;
deque<pair<long long, long long> > Q;

int main()
{
	scanf ("%d", &N);

	long long ans = 1, mmul = 1, mul = 1;
	Q = { { 1, 1 } };

	for (int i = 0; i < N; i++){
		long long x; scanf ("%lld", &x);

		if (x == 0){
			ans = 0;
			break;
		}

		long long last = Q.back().second;
		mul *= x;
		while (mul >= lim){
			mul /= Q[1].first;
			mmul = mmul * Q.front().second % mod * inv(last) % mod;
			Q.pop_front();
		}
		mmul = mmul * fpow(x, Q.size()) % mod;
		Q.push_back({ x, last * x % mod });
		ans = (ans * mmul) % mod;
	}

	printf ("%lld\n", ans);
	return 0;
}