#include <iostream>
#include<queue>
#include <algorithm>
#include <map>
#include<unordered_map>
#include <set>
#include <fstream>
#include <vector>
#include <math.h>
#include <iomanip>
#include <string>
#include <cstring>
using namespace std;
#define ll long long
ll mod = 1e9+7;
const int MaxN = 1e5+5;
int MOD = 998244353;
int bit[200000];
ll dem=0;
int main() {
// freopen(".INP", "r", stdin);
//freopen(".OUT", "w", stdout);
ll n,x;
cin >> n;
multiset<ll> ms;
set<ll> s;
for(int i=1;i<=n;i++){
cin >> x;
s.insert(x);
ms.insert(x);
}
for(ll i : s){
dem += (ms.count(i)*(ms.count(i)-1))/2;
}
cout << dem;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxxdWV1ZT4KI2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPG1hcD4KI2luY2x1ZGU8dW5vcmRlcmVkX21hcD4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPGZzdHJlYW0+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxtYXRoLmg+CiNpbmNsdWRlIDxpb21hbmlwPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8Y3N0cmluZz4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCiNkZWZpbmUgbGwgbG9uZyBsb25nCgpsbCBtb2QgPSAxZTkrNzsKY29uc3QgaW50IE1heE4gPSAxZTUrNTsKaW50IE1PRCA9IDk5ODI0NDM1MzsKaW50IGJpdFsyMDAwMDBdOwpsbCBkZW09MDsKCmludCBtYWluKCkgewoJLy8gZnJlb3BlbigiLklOUCIsICJyIiwgc3RkaW4pOwoJLy9mcmVvcGVuKCIuT1VUIiwgInciLCBzdGRvdXQpOwoJbGwgbix4OwoJY2luID4+IG47CgltdWx0aXNldDxsbD4gbXM7CiAgICBzZXQ8bGw+IHM7CiAgICBmb3IoaW50IGk9MTtpPD1uO2krKyl7CiAgICAJY2luID4+IHg7CiAgICAJcy5pbnNlcnQoeCk7CiAgICAJbXMuaW5zZXJ0KHgpOwoJfQoJZm9yKGxsIGkgOiBzKXsKCQlkZW0gKz0gKG1zLmNvdW50KGkpKihtcy5jb3VudChpKS0xKSkvMjsKCX0KCWNvdXQgPDwgZGVtOwoJcmV0dXJuIDA7Cn0=