#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
struct node {
  int val, id;
} arr[maxn];
bool cmp(node a, node b) { return a.val < b.val; }
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 1; i <= n; ++i) {
      scanf("%d", &arr[i].val);
      arr[i].id = i;
    }
    sort(arr + 1, arr + n + 1, cmp);
    int i = 1, j = 1;
    long long a = 0, b = 0, c = 0, ans = 0;
    while (arr[j].val == arr[i].val && j <= n) a++, j++;
    i = j;
    while (arr[j].val == arr[i].val && j <= n) b++, j++;
    i = j;
    while (arr[j].val == arr[i].val && j <= n) c++, j++;
    if (a == 1) {
      if (b == 1)
        ans = c;
      else
        ans = b * (b - 1) / 2;
    } else if (a == 2)
      ans = b;
    else if (a == 3)
      ans = 1;
    else
      ans = a * (a - 1) * (a - 2) / 6;
    printf("%lld\n", ans);
  }
  return 0;
}
