FRND  FRIENDSHIP!!!
Q[b] has recently been visited by extraterrestrials from planet Quan_Lank , where everyone’s name is a positive integer. All residents of the planet know each other. Two Quan_Lankians calculate the strength of their friendship by converting their names to binary, aligning them one under the other, and writing a digit in each column: 0 if the two binary digits in that column are equal, 1 if they differ. The binary result is then converted back to the decimal system.
For example, the friendship value of 19 and 10 equals 25:
1 0 0 1 1 = 19
0 1 0 1 0 = 10

1 1 0 0 1 = 25
The value of a planet in the Universe is defined as the sum of all friendship values. Q[b] has asked you to help him compute the value of planet Quan_Lank!
INPUT
The first line of input contains the positive integer N (the number of residents of planet Quan_Lank , 1<=N<=10^6).
The next N lines contain the names of residents  positive integers smaller than 10^6, one per line.
OUTPUT
The only line of output must contain the value of planet Quan_Lank.
SAMPLE
Input
2
19
10
Output
25
Input
3
7
3
5
Output
12
Second sample description: The friendship value of residents 1 and 2 equals 4, for residents 1 and 3
it equals 2, and for residents 2 and 3 it equals 6. The solution is 4 + 2 + 6 = 12.
hide comments
geek_grave:
20201218 10:23:15
use unsigned long long, also use (1LL<<j) for power as only 1 returns integer value, cost me 8 WA. Last edit: 20201218 11:04:09 

onkar_telange:
20201014 13:55:32
for storing the count of set and non set bits also use long long 

minhhoa_tr:
20181002 05:20:52
Someone who failed at 10th testcase please print %lld for the result 

shahi9935:
20180624 07:27:15
100th :) 

sagar_zhcet:
20170624 13:43:58
nice question


siddharth_0196:
20170516 14:07:50
pow(2,i) > WA


aeonflux:
20170215 21:47:59
too easy!


prakash:
20170130 20:03:59
easy one use long long for power computation also


poda_venna:
20160811 15:11:47
array of bitset leads to RTE 

zany:
20160803 21:26:32
submitted code in C++ A.C same code in python giving TLE!

Added by:  BLANKRK 
Date:  20140126 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 