#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long double PI = acos(-1);
const long long MOD = 1000000007;
const long long FMOD = 998244353;
const long double eps = 1e-9;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
signed main() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  map<long long, long long> mp1;
  for (long long i = 0; i < n; i++) {
    mp1[a[i]]++;
  }
  long long ans = 0, cnt = 0;
  set<long long> st;
  for (auto x : mp1) {
    if (cnt >= 3) break;
    st.insert(x.first);
    cnt += x.second;
  }
  if (st.size() == 1) {
    long long si = mp1[*st.begin()];
    cout << si * (si - 1) * (si - 2) / 6;
  } else if (st.size() == 2) {
    long long si1 = mp1[*st.begin()];
    long long si2 = mp1[*(--st.end())];
    if (si1 >= 2)
      cout << si1 * (si1 - 1) / 2 * si2;
    else if (si2 >= 2)
      cout << si1 * si2 * (si2 - 1) / 2;
  } else {
    cout << mp1[*(--st.end())];
  }
}
