#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5;
int INF = 2e9;
long long qpow(long long a, long long n) {
  long long re = 1;
  while (n) {
    if (n & 1) {
      re = re * a;
    }
    n >>= 1;
    a = a * a;
  }
  return re;
}
long long a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  long long cnt1 = 0, cnt2 = 0, cnt3 = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == a[1]) {
      cnt1++;
    }
  }
  if (a[2] != a[1]) {
    for (int i = 1; i <= n; i++) {
      if (a[i] == a[2]) {
        cnt2++;
      }
    }
  }
  if (a[3] != a[2]) {
    for (int i = 1; i <= n; i++) {
      if (a[i] == a[3]) {
        cnt3++;
      }
    }
  }
  long long ans;
  if (cnt1 >= 3) {
    ans = cnt1 * (cnt1 - 1) * (cnt1 - 2) / 6;
  } else if (cnt1 + cnt2 >= 3) {
    if (cnt1 == 1) {
      ans = cnt2 * (cnt2 - 1) / 2LL;
    } else {
      ans = cnt2;
    }
  } else {
    ans = cnt3;
  }
  printf("%I64d\n", ans);
  return 0;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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 maxn = 4e5;
int INF = 2e9;
long long qpow(long long a, long long n) {
  long long re = 1;
  while (n) {
    if (n & 1) {
      re = re * a;
    }
    n >>= 1;
    a = a * a;
  }
  return re;
}
long long a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  long long cnt1 = 0, cnt2 = 0, cnt3 = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == a[1]) {
      cnt1++;
    }
  }
  if (a[2] != a[1]) {
    for (int i = 1; i <= n; i++) {
      if (a[i] == a[2]) {
        cnt2++;
      }
    }
  }
  if (a[3] != a[2]) {
    for (int i = 1; i <= n; i++) {
      if (a[i] == a[3]) {
        cnt3++;
      }
    }
  }
  long long ans;
  if (cnt1 >= 3) {
    ans = cnt1 * (cnt1 - 1) * (cnt1 - 2) / 6;
  } else if (cnt1 + cnt2 >= 3) {
    if (cnt1 == 1) {
      ans = cnt2 * (cnt2 - 1) / 2LL;
    } else {
      ans = cnt2;
    }
  } else {
    ans = cnt3;
  }
  printf("%I64d\n", ans);
  return 0;
}

```