Welcome to ZOJ
Information
Select Problem
Runs
Ranklist
ZOJ Problem Set - 1541
Fence

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Workers are going to enclose a new working region with a fence. For their convenience the enclosed area has to be as large as possible. They have N rectangular blocks to build the fence. The length of the i-th block is Li meters. All blocks have the same height of 1 meter. The workers are not allowed to break blocks into parts. All blocks must be used to build the fence.


Input

The first line of the input file contains one integer N (3 <= N <= 100).

The following N lines describe fence blocks. Each block is represented by its length in meters (integer number, 1 <= Li <= 100).

Process to the end of file.


Output

Write to the output file one non-negative number S - maximal possible area of the working region (in square meters). S must be written with two digits after the decimal point. If it is not possible to construct the fence from the specified blocks, write 0.00.


Sample Input

4
10
5
5
4
3
8
5
5
3
10
5
4


Sample Output

28.00
12.00
0.00


Source: Northeastern Europe 2001, Northern Subregion
Submit    Status