#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 1e5 + 11;
ll a[N];
ll pre[N];

int main() {
	ios :: sync_with_stdio(false);
	
	int n; cin >> n;
	a[0] = pre[0] = 1;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		pre[i] = pre[i - 1] * a[i] % mod;
	}
	
	const ll lim = 1e9;
	
	ll ans = 1;
	if(count(a + 1, a + n + 1, 0))
		ans = 0;
	else {
		ll mul = 1;
		ll all = 1;
		int p = 0;
		for(int i = 1; i <= n; i ++) {
			if(p < i) {
				p = i;
				all = a[i];
				mul = a[i];
			} else {
				all = all * qpow(qpow(a[i - 1], p - i + 2), mod - 2) % mod;
				mul = mul / a[i - 1];
			}
			
			while(p < n && mul * a[p + 1] < lim) {
				p ++;
				mul = mul * a[p];
				all = all * mul % mod;
			}
			
			//~ cout << i << ' ' << p << ' ' << all << ' ' << mul << '\n';
			
			ans = ans * all % mod;
		}
		
	}
	cout << ans << '\n';
}