Makes And The Product

Description:

Input:

The first line of input contains a positive integer number n (3 ≤ n ≤ 10⁵) — the number of elements in array a. The second line contains n positive integer numbers a_i (1 ≤ a_i ≤ 10⁹) — the elements of a given array.

Output:

Print one number — the quantity of triples (i,  j,  k) such that i,  j and k are pairwise distinct and a_i·a_j·a_k is minimum possible.

Sample Input:

4
1 1 1 1

Sample Output:

4

Sample Input:

5
1 3 2 3 4

Sample Output:

2

Sample Input:

6
1 3 3 1 3 2

Sample Output:

1

Note:

In the first example Makes always chooses three ones out of four, and the number of ways to choose them is 4.

In the second example a triple of numbers (1, 2, 3) is chosen (numbers, not indices). Since there are two ways to choose an element 3, then the answer is 2.

In the third example a triple of numbers (1, 1, 2) is chosen, and there's only one way to choose indices.