ENG  RUSTimus Online Judge
Online Judge
Задачи
Авторы
Соревнования
О системе
Часто задаваемые вопросы
Новости сайта
Форум
Ссылки
Архив задач
Отправить на проверку
Состояние проверки
Руководство
Регистрация
Исправить данные
Рейтинг авторов
Текущее соревнование
Расписание
Прошедшие соревнования
Правила

1159. Fence

Ограничение времени: 1.0 секунды
Ограничение памяти: 64 МБ
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.

Исходные данные

The first line 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).

Результат

Write 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.

Пример

исходные данныерезультат
4
10
5
5
4
28.00
Автор задачи: Nick Durov
Источник задачи: ACM ICPC 2001. Northeastern European Region, Northern Subregion