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 <iostream>
#include <iomanip>
#include <cmath>

using namespace std;

int main(){
  int N;
  cin>>N;
  int64_t A[N];
  int64_t n=1;
  long double m=1.0;

  for(int i=0; i<N; i++){
    cin>>A[i];
    m*=A[i];
    n*=A[i];
  }
  if(m>1.0e+18){
    cout<<"-1"<<endl;
  }else{
    cout<<n<<endl;
  }

  return 0;
}
