#include <bits/stdc++.h>
#define rep(i, ss, ee) for (int i = ss; i < ee; ++i)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;

inline ll f(ll k) {
  ll sum = 1;
  for (ll ii = 1; ii <= k; ++ii) { sum *= ii; }
  return sum;
}

void solve() {
  int N;
  cin >> N;
  vector<ll> a(N);

  ll mx = 0;
  rep(i, 0, N) {
    cin >> a[i];
    if (a[i] == 0) {
      cout << 0 << endl;
      return;
    }
    mx = max(mx, a[i]);
  }
  if (mx >= 4) {
    cout << MOD << endl;
    return;
  }

  ll ans = 1;
  for (ll x : a) { ans *= pow(x, f(x)); }

  ans = MOD % ans;
  cout << ans << endl;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
}