#include <bits/stdc++.h>
using namespace std;
map<long long, long long> m;
set<long long> s;
long long fun(long long x, long long y) {
  long long res = 1;
  for (long long i = x; i >= 1; i--) {
    res *= y;
    y--;
  }
  for (long long i = 1; i <= x; i++) {
    res /= i;
  }
  return res;
}
int main() {
  set<long long>::iterator it;
  long long n, x;
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &x);
    s.insert(x);
    m[x]++;
  }
  it = s.begin();
  if (m[*it] >= 3) {
    printf("%lld\n", fun(3, m[*it]));
  } else if (m[*it] == 2) {
    it++;
    printf("%lld\n", m[*it]);
  } else if (m[*it] == 1) {
    it++;
    if (m[*it] == 1) {
      it++;
      printf("%lld\n", m[*it]);
    } else if (m[*it] >= 2) {
      printf("%lld\n", fun(2, m[*it]));
    }
  }
  return 0;
}

### Prompt

In cpp, your task is to solve the following problem:

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;
map<long long, long long> m;
set<long long> s;
long long fun(long long x, long long y) {
  long long res = 1;
  for (long long i = x; i >= 1; i--) {
    res *= y;
    y--;
  }
  for (long long i = 1; i <= x; i++) {
    res /= i;
  }
  return res;
}
int main() {
  set<long long>::iterator it;
  long long n, x;
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &x);
    s.insert(x);
    m[x]++;
  }
  it = s.begin();
  if (m[*it] >= 3) {
    printf("%lld\n", fun(3, m[*it]));
  } else if (m[*it] == 2) {
    it++;
    printf("%lld\n", m[*it]);
  } else if (m[*it] == 1) {
    it++;
    if (m[*it] == 1) {
      it++;
      printf("%lld\n", m[*it]);
    } else if (m[*it] >= 2) {
      printf("%lld\n", fun(2, m[*it]));
    }
  }
  return 0;
}

```