Maximum Product of a Contiguous Subsequence

Time limit1sMemory limit128 MB

Problem

Given N real numbers, choose one or more consecutive numbers so that their product is as large as possible. Print that maximum product.

Input

The first line contains the number of real numbers, N.

Each of the next N lines contains one real number.

N is a natural number no greater than 10,000. Each real number is given to one decimal place and is at least 0.0 and at most 9.9.

Output

Print the maximum product rounded to three digits after the decimal point.