#include <iostream>
#include <algorithm>
using namespace std; 
int b[100000];
int main(){
	int n, M = 0, ans = 0;
	cin >> n;
	int a[n];
	for(int i = 0; i < n; ++i){
		cin >> a[i];
		M = max(M, a[i]);
		++b[a[i] - 1];
	}
	for(int i = 0; i < M; ++i){
		if(b[i] == 2){
			for(int j = 0; j < 2 * i; ++j){
				ans += (b[i] - 1) * b[i] / 2 * b[j];
			}
		}else if(b[i] >= 3)
			ans += b[i] * (b[i] - 1) * (b[i] - 2) / 6;
	}
	cout << ans;
	return 0;
}

ball ball you help help this 蒟蒻