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 Ruby (2.3.3) (judge verdict: Wrong Answer)

# 値とその出現回数でdictなりして値が大きいやつから採用すりゃいい
# 8 8 8 9 10 10 10 10 11 11など
# -> 失敗 5ケースほど
#    4つ以上あるときにもansをkで更新してしまっていたのがミスかな
n = gets.chomp.to_i
arr = gets.chomp.split.map(&:to_i)
dict = {}
arr.each do |a|
  if dict.has_key?(a)
    dict[a]+=1
  else
    dict[a]=1
  end
end
dict = dict.sort.reverse
a, b = 0, 0
ans = 0
dict.each do |k, v|
  break if ans != 0
  if v>=4
    a, b = k, k
  elsif a == 0 && v>=2
    a = k
  elsif a != 0 && v>=2
    b = k
  end
  ans = a*b
end

puts ans