Sum Of Bit Differences Of All Pairs

easy
Question Solve Solutions 
1. You are given an array of n numbers.
2. You have to find the sum of bit differences in all pairs that can be formed from n numbers.
3. Bit difference of two numbers is defined as the count of different bits at same positions in binary representations of two numbers.

Input Format

A number n a1 a2.. n numbers

Output Format

Check the sample ouput and question video.

Constraints

1 <= n <= 10^9
1 <= arr[i] <= 10^9

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
3
1 2 3
Output
8
Previous
Swap All Odd And Even Bits
Next
Josephus Special

Related Questions

easy Gray Code easy Basics Of Bit Manipulation easy Print Value Of Rsb Mask easy Kernighans Algorithm easy All Repeating Except One easy All Repeating Except Two easy All Repeating Three Times Except One easy One Repeating And One Missing easy Flip Bits To Convert A To B easy Copy Set Bits In A Range easy Check Divisibility By 3 easy Print Binary And Reverse Bits easy Count Set Bits In First N Natural Numbers easy Is A Power Of 2 easy Solve 7n By 8 easy Swap All Odd And Even Bits