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>
using namespace std;
long long b[100000];
int main(){
	long long pos=1000000000000000000;
	int a;
	cin>>a;
	long long ans=1;
	for(int i=1;i<=a;i++){
		cin>>b[i];
		if(b[i]==0){
		
		cout<<"0"<<endl;
		return 0;}
	
	
}

 for(int i=1;i<=a;i++){
	  if(b[i]<=pos/ans){
	  	ans=ans*b[i];
	  }
	  else {cout<<"-1";
	  return 0;
	  }
}cout<<ans<<endl;
}