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 Rust (1.15.1) (judge verdict: Wrong Answer)

use std::collections::HashMap;
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}
fn main(){
    let n: i32 = read();
    let sub_an:Vec<i32> = read_vec();
    let mut an = sub_an.iter().fold(HashMap::new(),|mut map ,x| {
        let y = map.get(&x).map(|i| i + 1).unwrap_or(1);
        map.insert(x,y);
        map
    })
    .into_iter()
    .flat_map(|(x,y)|{
        if y >= 4{
            vec![x,x]
        } else if y>= 2 {
            vec![x]
        }else {
            vec![]
        } 
    })
    .collect::<Vec<&i32>>();
    an.sort();
    an.reverse();
    let ans = if an.len() >= 2{
        an[0] * an[1]
    } else{
        0
    };
    println!("{}",ans);
}