Problem:
Score : 300 points

Problem Statement

We have N sticks with negligible thickness.
The length of the i-th stick is A_i.

Snuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.
Find the maximum possible area of the rectangle.

Constraints

4 \leq N \leq 10^5

1 \leq A_i \leq 10^9

A_i is an integer.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible area of the rectangle.
If no rectangle can be formed, print 0.

Sample Input 1

6
3 1 2 4 2 1

Sample Output 1

2

1 \times 2 rectangle can be formed.

Sample Input 2

4
1 2 3 4

Sample Output 2

0

No rectangle can be formed.

Sample Input 3

10
3 3 3 3 4 4 4 5 5 5

Sample Output 3

20

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Text;
using System.Collections.Generic;
using System.Linq;
class Solve
{
    public static void Main()
    {
        var n = int.Parse(Console.ReadLine());
        var a = Console.ReadLine().Split().Select(long.Parse).ToArray();

        var a_disinct = a.Distinct().ToArray();
        var a_group = a.GroupBy(e => e);
        var ab = a_group.Select(e => new { e.Key, Count = e.Count() }).Where(e => e.Count >= 2).OrderByDescending(e => e.Key).Take(2).ToArray();
        if (ab[0].Count >= 4)
        {
            long max = ab[0].Key;
            Console.WriteLine(max * max);
            return;
        }
        Console.WriteLine(ab.Count() >= 2 ? ab[0].Key * ab[1].Key : 0);

    }
}