Given N integers A_1, ..., A_N, compute A_1 \times ... \times A_N.

However, if the result exceeds 10^{18}, print `-1` instead.

Constraints

* 2 \leq N \leq 10^5
* 0 \leq A_i \leq 10^{18}
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 ... A_N


Output

Print the value A_1 \times ... \times A_N as an integer, or `-1` if the value exceeds 10^{18}.

Examples

Input

2
1000000000 1000000000


Output

1000000000000000000


Input

3
101 9901 999999000001


Output

-1


Input

31
4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0


Output

0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
  int n; cin >> n;
  bool ok=1, z=0;
  ll ans = 1;
  for (int i= 0; i < n; i++) {
    ll tmp; cin >> tmp;
    if (tmp==0) {
      ans=0;
      z=1;
      continue;
    }
    if (ans > ((ll)1e18)/tmp)ok=0;
    ans *= tmp;
  }
  if (!ok && !z) cout << -1;
  else cout << ans;
}
