#include <bits/stdc++.h>
using namespace std;
int factorial(int n) { return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n; }
int main() {
  int N = 0;
  cin >> N;
  int numlist[100000];
  for (int i = 0; i < N; i++) {
    cin >> numlist[i];
  }
  sort(numlist, numlist + N);
  int x = 1;
  if (numlist[0] == numlist[1]) {
    x++;
  }
  if (numlist[1] == numlist[2]) {
    x++;
  }
  int a1 = numlist[0];
  int a2 = numlist[1];
  int a3 = numlist[2];
  long long count1 = 0;
  long long count2 = 0;
  long long count3 = 0;
  for (int i = 0; i < N; i++) {
    if (numlist[i] == a1) {
      count1++;
    }
  }
  for (int i = 1; i < N; i++) {
    if (numlist[i] == a2) {
      count2++;
    }
  }
  for (int i = 2; i < N; i++) {
    if (numlist[i] == a3) {
      count3++;
    }
  }
  cout << count1 * count2 * count3 / factorial(x);
}
