#abc169b. [abc169_b]Multiplication 2

[abc169_b]Multiplication 2

Problem Statement

Given NN integers A1,...,ANA_1, ..., A_N, compute A1times...timesANA_1 \\times ... \\times A_N.

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

Constraints

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

Input

Input is given from Standard Input in the following format:

NN A1A_1 ...... ANA_N

Output

Print the value A1times...timesANA_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 101810^{18}.


Sample Input 1

2
1000000000 1000000000

Sample Output 1

1000000000000000000

We have $1000000000 \\times 1000000000 = 1000000000000000000$.


Sample Input 2

3
101 9901 999999000001

Sample Output 2

-1

We have $101 \\times 9901 \\times 999999000001 = 1000000000000000001$, which exceeds 101810^{18}, so we should print -1 instead.


Sample Input 3

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

Sample Output 3

0