#line 1 "/workspaces/compro/lib/template.hpp" #line 1 "/workspaces/compro/lib/io/vector.hpp" #include #include #ifndef IO_VECTOR #define IO_VECTOR template std::ostream &operator<<(std::ostream &out, const std::vector &v) { int size = v.size(); for (int i = 0; i < size; i++) { std::cout << v[i]; if (i != size - 1) std::cout << " "; } return out; } template std::istream &operator>>(std::istream &in, std::vector &v) { for (auto &el : v) { std::cin >> el; } return in; } #endif #line 4 "/workspaces/compro/lib/template.hpp" #include #define REP(i, n) for (int i = 0; i < n; i++) #define FOR(i, m, n) for (int i = m; i < n; i++) #define ALL(v) (v).begin(), (v).end() #define coutd(n) cout << fixed << setprecision(n) #define ll long long int #define vl vector #define vi vector #define MM << " " << using namespace std; template void say(bool val, T yes, T no) { cout << (val ? yes : no) << "\n"; } void say(bool val, string yes = "Yes", string no = "No") { say(val, yes, no); } template void chmin(T &a, T b) { if (a > b) a = b; } template void chmax(T &a, T b) { if (a < b) a = b; } // C++ 17に完全移行したら消す // 最大公約数を求める template T gcd(T n, T m) { return n ? gcd(m % n, n) : m; } // 最小公倍数を求める template T lcm(T n, T m) { int g = gcd(n, m); return n * m / g; } // 重複を消す。計算量はO(NlogN) template void unique(std::vector &v) { std::sort(v.begin(), v.end()); v.erase(std::unique(v.begin(), v.end()), v.end()); } #line 2 "main.cpp" ll MOD = 1000000007; ll solve(int n, const std::vector &a) { REP(i, n) { if (a[i] == 0) return -1; } ll ans = 1; ll f[5] = {1, 1, 2, 6, 24}; REP(i, n) { if (a[i] >= 5) return MOD; REP(j, f[a[i]]) { ans *= a[i]; if (ans >= MOD) return MOD; } } return MOD % ans; } // generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator) int main() { // failed to analyze input format // TODO: edit here int n; std::cin >> n; std::vector a(n); for (int i = 0; i < n; ++i) { std::cin >> a[i]; } auto ans = solve(n, a); std::cout << ans << std::endl; return 0; }