You are given a sequence of N integer numbers A. Calculate the sum of Ai AND Aj for all the pairs (i, j) where i < j. 
 The AND operation is the Bitwise AND operation, defined as in here. 

Input
The first line of input consists of the integer N. 
The second line contains N integer numbers - the sequence A.

Output
Output the answer to the problem on the first line of the output.

Example
Input:
5
1 2 3 4 5

Output:
9


Scoring

Subtask 1 (13 points): N <= 1000, Ai <= 1. 
Subtask 2 (39 points): N <= 1000, Ai <= 10^9. 
Subtask 3 (21 points): N <= 10^5, Ai <= 1. 
Subtask 4 (27 points): N <= 10^5, Ai <= 10^6.
n=input()
ar=[0 for x in xrange(30)]
def f(s):
	s=bin(int(s))[2:]
#	print "s=",s,"ar=",ar
	ls=len(s)
	for i in xrange(ls):
	#	print "i=",i ,"s[i]= ",s[i]
		if (s[i]=="1"):ar[30-ls+i]+=1
	
l=map(f,raw_input().split())
#print l,ar
ans=0
i=29
for x in ar:
	if(x>1):
	#	print "x=",x,"i=",i
		num=(x*(x-1)*(2**(i-1)))
	#	print "num= ",num
		ans+=num
	i-=1
print int(ans)