Dima got into number sequences. Now he's got sequence *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>, consisting of *n* positive integers. Also, Dima has got a function *f*(*x*), which can be defined with the following recurrence:
 -  *f*(0) = 0; -  *f*(2·*x*) = *f*(*x*); -  *f*(2·*x* + 1) = *f*(*x*) + 1. 
Dima wonders, how many pairs of indexes (*i*, *j*) (1 ≤ *i* &lt; *j* ≤ *n*) are there, such that *f*(*a*<sub class="lower-index">*i*</sub>) = *f*(*a*<sub class="lower-index">*j*</sub>). Help him, count the number of such pairs.
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>). The second line contains *n* positive integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).

The numbers in the lines are separated by single spaces.
n = int(input())
lis=list(map(int,input().split()))
ans=[0]*(n)
for i in range(n):
    k=lis[i]
    c=0
    while k>0:
        if k%2!=0:
            c+=1
        k=k//2    
    ans[i]=c   
ans.sort()
c=1
fin=0
#print(ans)
for i in range(1,n):
    if ans[i-1]==ans[i]:
        c+=1
    else:
        fin+=((c*(c-1))//2)
        c=1    
fin+=((c*(c-1))//2)
print(fin)            


