#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const int MAX = (int)1e5 + 5;
void build() { return; }
int n;
int store[MAX];
void Init() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) scanf("%d", store + i);
  sort(store, store + n);
  return;
}
void sol() {
  if (n == 3)
    puts("1");
  else {
    if (store[2] != store[3])
      puts("1");
    else {
      int cnt = 1;
      for (int i = (3); i < (n); ++i) {
        if (store[i] == store[2])
          cnt++;
        else
          break;
      }
      if (store[1] == store[2]) {
        if (store[0] == store[1])
          printf("%lld", (long long)cnt * (cnt + 1) * (cnt + 2) / 6);
        else
          printf("%lld", (long long)cnt * (cnt + 1) / 2);
      } else
        printf("%d", cnt);
    }
  }
  return;
}
int main(void) {
  Init();
  build();
  sol();
  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;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const int MAX = (int)1e5 + 5;
void build() { return; }
int n;
int store[MAX];
void Init() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) scanf("%d", store + i);
  sort(store, store + n);
  return;
}
void sol() {
  if (n == 3)
    puts("1");
  else {
    if (store[2] != store[3])
      puts("1");
    else {
      int cnt = 1;
      for (int i = (3); i < (n); ++i) {
        if (store[i] == store[2])
          cnt++;
        else
          break;
      }
      if (store[1] == store[2]) {
        if (store[0] == store[1])
          printf("%lld", (long long)cnt * (cnt + 1) * (cnt + 2) / 6);
        else
          printf("%lld", (long long)cnt * (cnt + 1) / 2);
      } else
        printf("%d", cnt);
    }
  }
  return;
}
int main(void) {
  Init();
  build();
  sol();
  return 0;
}

```