#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>
#include <atcoder/all>

#include <bits/stdc++.h>


#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace atcoder;
using namespace std;
typedef long long int ll;
typedef modint1000000007 mint;




ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;

    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

/*
解説動画参考
解説ブログ参考

*/



int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    
    while (Q--) {
        int n;
        cin >> n;
        vector<ll>a(n);
        for (int i = 0; i < n; i++)cin >> a[i];
        sort(a.begin(), a.end());
        if (a[0] == 0) {
            cout << -1;
            return 0;
        }
        ll ans = 1;
        for (int i = 0; i < n; i++) {
            if (a[i] >= 5) {
                cout << 1000000007; return 0;
            }
            ll x = 1;
            for (int j = 1; j <= a[i]; j++) {
                x *= j;
            }
            for (int j = 0; j < x; j++) {
                ans *= a[i];
                if (ans > 1000000007) {
                    cout << 1000000007; return 0;
                }
            }
        }
        cout <<(ll) (1000000007) % ans;

    }

    return 0;
}