#include <atcoder/modint>
using namespace atcoder;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
using namespace std;
using ll = long long;
template<typename T>
inline bool chmax(T& a, const T& b) {
    if (a < b){
        a = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/**
 * @brief 多次元 vector の作成
 * @author えびちゃん
 */
namespace detail {
    template<typename T, int N>
    auto make_vec(vector<int>& sizes, T const& x) {
        if constexpr (N == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[N-1];
            sizes.pop_back();
            return vector(size, make_vec<T, N-1>(sizes, x));
        }
    }
}
template<typename T, int N>
auto make_vec(int const(&sizes)[N], T const& x = T()) {
    vector<int> s(N);
    for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1];
    return detail::make_vec<T, N>(s, x);
}
__attribute__((constructor))
void fast_io() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

using mint = modint1000000007;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    bool zero = false;
    rep(i, n) {
        cin >> a[i];
        if (a[i] == 0) zero = true;
    }
    if (zero) {
        cout << -1 << '\n';
        return 0;
    }
    const int mod = 1000000007;
    rep(i, n) {
        if (a[i] >= 4) {
            cout << mod << '\n';
            return 0;
        }
    }

    ll mul = 1;
    rep(i, n) {
        int k = 1;
        for (int j = 1; j <= a[i]; ++j) k *= j;
        rep(j, k) mul *= a[i];
        if (mul > mod) {
            cout << mod << '\n';
            return 0;
        }
    }

    cout << mod % mul << '\n';
}