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.

Examples

Input

6
3 1 2 4 2 1


Output

2


Input

4
1 2 3 4


Output

0


Input

10
3 3 3 3 4 4 4 5 5 5


Output

20
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        
        Integer[] a = new Integer[N];
        
        Map<Integer, Integer> map = new HashMap<>();
        for(int i=0; i<N; i++) {
            a[i] = Integer.parseInt(sc.next());
            if(map.containsKey(a[i])) {
                map.put(a[i], map.get(a[i])+1);
            }else {
                map.put(a[i], 1);
            }
        }
        
        Object[] mapkey = map.keySet().toArray();
        Arrays.sort(mapkey, Collections.reverseOrder());
        long hen1 = 0;
        long hen2 = 0;
        for(Object ob : mapkey) {
            int x = Integer.parseInt(String.valueOf(ob)); 
            if(map.get(x) >= 4) {
                if(hen1 == 0) {
                    hen1 = x;
                    hen2 = x;
                }else {
                    hen2 = x;
                }
                break;
            }else if(map.get(x) >= 2) {
                if(hen1 == 0) {
                    hen1 = x;
                }else {
                    hen2 = x;
                    break;
                }
            }
        }
        
        System.out.println(hen1*hen2);
    }
}
