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.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];
		List<Integer> list = new ArrayList<>();
		long l1 = 0L,l2 = 0L;

		for (int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
		}

		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for (int ai : A) {
			Integer i = map.get(ai);
			map.put(ai, i == null ? 1 : i + 1);
		}

		for (int key : map.keySet()) {
			if ( map.get(key) >= 2) list.add(key);
		}
		Integer[] answers = (Integer[]) list.toArray(new Integer[0]);
		if (answers.length >= 2) {
			Arrays.sort(answers);
			l2 = (long)answers[answers.length-1]*(long)answers[answers.length-2];
		}
		list.clear();

		for (int key : map.keySet()) {
	    	if ( map.get(key) >= 4) list.add(key);
		}
		Integer[] answers2 = (Integer[]) list.toArray(new Integer[0]);
	    if (answers2.length >= 1) {
		    Arrays.sort(answers2);
		    l1 = (long)answers2[answers2.length-1]*(long)answers2[answers2.length-1];
	    }
	    System.out.println(Math.max(l1, l2));
	}

}
