#include <bits/stdc++.h>
using namespace std;
const unsigned long long M = 1e9 + 10;
const unsigned long long N = 1e9 + 10;
map<unsigned long long, unsigned long long> cnt;
unsigned long long combination(unsigned long long n, unsigned long long m) {
  unsigned long long i, j;
  unsigned long long sum = 1;
  if (n == 0 || m == 0)
    return 1;
  else {
    for (i = m + 1, j = 1; i <= n; i++, j++) {
      sum = sum * i / j;
    }
    return sum;
  }
}
int main() {
  unsigned long long n;
  cin >> n;
  unsigned long long m1 = N, m2 = N, m3 = N;
  for (unsigned long long i = 0; i < n; i++) {
    unsigned long long t;
    scanf("%lld", &t);
    if (t < m1) {
      m3 = m2;
      m2 = m1;
      m1 = t;
    } else if (t < m2) {
      m3 = m2;
      m2 = t;
    } else if (t < m3) {
      m3 = t;
    }
    cnt[t]++;
  }
  if (m1 == m2 && m1 == m3)
    cout << combination(cnt[m1], 3) << endl;
  else if ((m1 == m2 && m1 != m3))
    cout << cnt[m3] << endl;
  else if ((m2 == m3 && m1 != m2))
    cout << cnt[m1] * combination(cnt[m2], 2) << endl;
  else
    cout << cnt[m1] * cnt[m2] * cnt[m3] << endl;
}
