#t95. 乘法问题

乘法问题

Multiplication Problem

Problem Description

Little A has just learned multiplication. To help him practise, we give him several positive integers and ask him to multiply them all together.

For most cases Little A can work out the exact answer, but if the product exceeds 10610^6, he gives up.

Write a program that tells us how Little A will answer.

Input Format

The first line contains an integer nn, the number of positive integers.

The following nn lines each contain one integer aa. Little A needs to multiply all the aa's together.

Output Format

Print one line. If the product exceeds 10610^6, output >1000000; otherwise output the product of all the numbers.

Sample Input

Sample Input 1

2
3
5

Sample Input 2

3
100
100
100

Sample Input 3

4
100
100
100
2

Sample Output

Sample Output 1

15

Sample Output 2

1000000

Sample Output 3

>1000000

Sample Explanation

For sample 1, the first line is n=2n=2, meaning there are two numbers. The next two lines are 33 and 55; their product is 1515, which does not exceed 10610^6, so we output 1515.

Constraints

For all test data, 1≤n≤501 \le n \le 50 and 1≤a≤1001 \le a \le 100.