FRND - FRIENDSHIP!!!


Q[b] has recently been visited by extra-terrestrials from planet Quan_Lank, where everyone’s name is a positive integer. All residents of the planet know each other. Two Quan_Lank-ians 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
vl4deee11: 2024-09-11 22:17:12

good question!
note: if n == 1 => cin>>k; cout<<k;

shimul58: 2021-05-12 22:41:40

nice question

geek_grave: 2020-12-18 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: 2020-12-18 11:04:09
onkar_telange: 2020-10-14 13:55:32

for storing the count of set and non set bits also use long long

minhhoa_tr: 2018-10-02 05:20:52

Someone who failed at 10th testcase please print %lld for the result

shahi9935: 2018-06-24 07:27:15

100th :-)

sagar_zhcet: 2017-06-24 13:43:58

nice question
learned a lot about bits...

siddharth_0196: 2017-05-16 14:07:50

pow(2,i) --> WA
(1<<i) -->AC

aeonflux: 2017-02-15 21:47:59

too easy!

prakash: 2017-01-30 20:03:59

easy one use long long for power computation also


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