Logo C++ Online Judge

C++

时间限制:1 s 空间限制:128 MB
TA: 惠宇龙
统计
Description

Given a sequence of integers, multiply these numbers.

Input format:

The first line is an integer $n$, representing the number of positive integers.

Next, there are $n$ lines, each with an integer $a$. You need to multiply all the $a$ together.

Output format:

If the product exceeds $10^9$ then output the string >1000000000, otherwise just output the final product.

Constraint:

$1\le n\le 20$ , $1\le a\le 10000$

Input Example:
3
20
10
10

Output Example:
2000