#include <bits/stdc++.h>
using namespace std;
long long q[100010];
long long C(long long n1, long long n2) {
  long long temp = 1;
  for (long long i = 1; i <= n2; i++) {
    temp *= (n1 - i + 1);
  }
  for (long long i = 1; i <= n2; i++) {
    temp /= i;
  }
  return temp;
}
int main() {
  long long i, j, k, a, b, c, n;
  scanf("%I64d", &n);
  for (i = 0; i < n; i++) {
    scanf("%I64d", &q[i]);
  }
  sort(q, q + n);
  a = q[0];
  b = q[1];
  c = q[2];
  long long c1 = 0;
  long long c2 = 0;
  long long c3 = 0;
  for (i = 0; i < n; i++) {
    if (q[i] == a) c1++;
    if (q[i] == b) c2++;
    if (q[i] == c) c3++;
  }
  long long ans = 0;
  if (a == b && b == c) {
    ans = C(c1, 3);
  } else if (a == b && b != c) {
    ans = C(c1, 2) * c3;
  } else if (a != b && b == c) {
    ans = C(c2, 2) * c1;
  } else {
    ans = c1 * c2 * c3;
  }
  printf("%I64d\n", ans);
  return 0;
}
