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()
A = map(int,raw_input().split())
ans = 0
maxbits = 0
for x in A:
	maxbits = max(maxbits,len(bin(x)[2:]))

for x in xrange(1,maxbits+1):
	cur = 0
	for y in A:
		if len(bin(y)[2:]) >= x:
			cur += int(bin(y)[2:][-x])
	ans += ((2**(x-1))*(cur*(cur-1)))/2
print ans