#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1000000000;
long long modpow(long long a, long long b){
	a %= MOD;
	long long res = 1;
	while (b > 0){
		if (b % 2 == 1) res = res * a % MOD;
		a = a * a % MOD;
		b = b / 2;
	}
	return res;
}
long long modinv(long long a){
	return modpow(a, MOD - 2);
}
int main(){
  int N;
  cin >> N;
  vector<long long> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  bool zero = false;
  for (int i = 0; i < N; i++){
    if (A[i] == 0){
      zero = true;
    }
  }
  if (zero){
    cout << 0 << endl;
  } else {
    int R = 0;
    long long ans = 1;
    long long curr = 1;
    long long tmp = 1;
    for (int L = 0; L < N; L++){
      while (1){
        if (R == N){
          break;
        }
        if (curr * A[R] >= INF){
          break;
        }
        curr *= A[R];
        R++;
        tmp *= curr;
        tmp %= MOD;
      }
      ans *= tmp;
      ans %= MOD;
      curr /= A[L];
      tmp *= modpow(modinv(A[L]), R - L);
      tmp %= MOD;
    }
    cout << ans << endl;
  }
}