#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e6 + 4;
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
  }
  return res;
}
int main() {
  long long n;
  cin >> n;
  long long a[n];
  map<long long, long long> m;
  for (long long i = 0; i < n; i++) cin >> a[i], m[a[i]]++;
  sort(a, a + n);
  long long i, j, k;
  i = a[0], j = a[1], k = a[2];
  if (i != j && j != k)
    cout << m[i] * m[j] * m[k] << "\n";
  else if (i == j && i == k)
    cout << (m[i] * (m[i] - 1) * (m[i] - 2)) / 6 << "\n";
  else if (i == j && i != k)
    cout << ((m[i] * (m[i] - 1)) / 2) * m[k] << '\n';
  else if (i != j && j == k)
    cout << ((m[k] * (m[k] - 1)) / 2) * m[i];
  else if (i != j && i == k)
    cout << ((m[k] * (m[k] - 1)) / 2) * m[j];
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

After returning from the army Makes received a gift — an array a consisting of n positive integer numbers. He hadn't been solving problems for a long time, so he became interested to answer a particular question: how many triples of indices (i, j, k) (i < j < k), such that ai·aj·ak is minimum possible, are there in the array? Help him with it!

Input

The first line of input contains a positive integer number n (3 ≤ n ≤ 105) — the number of elements in array a. The second line contains n positive integer numbers ai (1 ≤ ai ≤ 109) — 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 ai·aj·ak is minimum possible.

Examples

Input

4
1 1 1 1


Output

4


Input

5
1 3 2 3 4


Output

2


Input

6
1 3 3 1 3 2


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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e6 + 4;
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
  }
  return res;
}
int main() {
  long long n;
  cin >> n;
  long long a[n];
  map<long long, long long> m;
  for (long long i = 0; i < n; i++) cin >> a[i], m[a[i]]++;
  sort(a, a + n);
  long long i, j, k;
  i = a[0], j = a[1], k = a[2];
  if (i != j && j != k)
    cout << m[i] * m[j] * m[k] << "\n";
  else if (i == j && i == k)
    cout << (m[i] * (m[i] - 1) * (m[i] - 2)) / 6 << "\n";
  else if (i == j && i != k)
    cout << ((m[i] * (m[i] - 1)) / 2) * m[k] << '\n';
  else if (i != j && j == k)
    cout << ((m[k] * (m[k] - 1)) / 2) * m[i];
  else if (i != j && i == k)
    cout << ((m[k] * (m[k] - 1)) / 2) * m[j];
  return 0;
}

```