#include<iostream>
#include<map>
using namespace std;
#define int long long int
signed main()
{
int n;
cin>>n;
map<int,int>mp;
for(int i=0;i<n;i++){
int x;
cin>>x;
int ans=0;
while(x){
ans+=x%2;
x/=2;
}
mp[ans]++;
}
int ans=0;
for(auto x:mp){
ans+=(x.second)*(x.second-1)/2;
}
cout<<ans<<endl;
return 0;
}
1245C - Constanze's Machine | 1005A - Tanya and Stairways |
1663F - In Every Generation | 1108B - Divisors of Two Integers |
1175A - From Hero to Zero | 1141A - Game 23 |
1401B - Ternary Sequence | 598A - Tricky Sum |
519A - A and B and Chess | 725B - Food on the Plane |
154B - Colliders | 127B - Canvas Frames |
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |