Code Forces 525C Ilya and Sticks

E - E

Time Limit:2000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 525C

Description

In the evening, after the contest Ilya was bored, and he really felt like maximizing. He remembered that he had a set of n sticks and an instrument. Each stick is characterized by its length l_i.

Ilya decided to make a rectangle from the sticks. And due to his whim, he decided to make rectangles in such a way that maximizes their total area. Each stick is used in making at most one rectangle, it is possible that some of sticks remain unused. Bending sticks is not allowed.

Sticks with lengths a₁, a₂, a₃ and a₄ can make a rectangle if the following properties are observed:

• a₁ ≤ a₂ ≤ a₃ ≤ a₄
• a₁ = a₂
• a₃ = a₄

A rectangle can be made of sticks with lengths of, for example, 3 3 3 3 or 2 2 4 4. A rectangle cannot be made of, for example, sticks 5 5 5 7.

Ilya also has an instrument which can reduce the length of the sticks. The sticks are made of a special material, so the length of each stick can be reduced by at most one. For example, a stick with length 5 can either stay at this length or be transformed into a stick of length 4.

You have to answer the question — what maximum total area of the rectangles can Ilya get with a file if makes rectangles from the available sticks?

Input

The first line of the input contains a positive integer n (1 ≤ n ≤ 10⁵) — the number of the available sticks.

The second line of the input contains n positive integers l_i (2 ≤ l_i ≤ 10⁶) — the lengths of the sticks.

Output

The first line of the output must contain a single non-negative integer — the maximum total area of the rectangles that Ilya can make from the available sticks.

Sample Input

Input

4
2 4 4 2

Output

8

Input

4
2 2 3 5

Output

0

Input

4
100003 100004 100005 100006

Output

10000800015

给定一些木棒的长度，问这些木棒能构成的矩形最大面积和是多少。

思路是就贪心。排序后从大到小。

注意要用 long long.

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
long long a[100005];
long long s[100005];
int main()
{
    int n;
    scanf("%d",&n);
    memset(s,0,sizeof(s));
    for(int i=0;i<n;i++)
        scanf("%I64d",&a[i]);
    sort(a,a+n);
    int i=n-1;
    int edge=-1;
    while(i>0)
    {
        if(a[i]==a[i-1]||a[i]==(a[i-1]+1))
        {
            if(edge==-1)
                edge=a[i-1];
            else
            {
                s[i-1]=edge*a[i-1];
                edge=-1;
            }
            i-=2;
        }
        else
        {
            i--;
        }
    }
    long long sum=0;
    for(int i=0;i<100005;i++)
    {
        if(s[i]!=0)
            sum+=s[i];
    }
    printf("%I64d\n",sum);
}