Killjee and easy problem

Killjee is solving an easy problem. Given an array $a$ containing $N$ positive integers. You need to find the magic value of the array.

Magic value of an array is ${\sum }_{i=1}^N\left({b_i}^i\right)$. where, $b_i$ is number of set bits of $a_i$.

Find and print the answer Modulo $({10}^{10}+11)$

INPUT CONSTRAINTS

• $1\le N\le {10}^5$
• $1\le a_i\le {10}^9$

INPUT FORMAT
First line of input contains a single integer $N$. Next line contains $N$ space separated integers, elements of array $a$.

OUTPUT FORMAT
Output a single integer, magic value of the array.

Sample Input

3
1 2 4

Sample Output

3

Explanation

$b\left[1\right]=1,b\left[2\right]=1$ and $b\left[3\right]=1$ so, summation of $b[i{]}^i$ = $1+1+1=3$.

Note: Your code should be able to convert the sample input into the sample output. However, this is not enough to pass the challenge, because the code will be run on multiple test cases. Therefore, your code must solve this problem statement.

    
// JAVA Solution
import java.util.Scanner;
public class CountSetBitsInInteger {
 
 public static void main(String[] args) {
 int b=0;
  Scanner sc = new Scanner(System.in);
  int n = sc.nextInt();
  int arr[] =  new int[n];
  for(int i=0;i0){
   if(number%2 == 1){
    counter++;
   }
   number = number/2; //or number = number >> 1
  }
  return counter;
 } 
}