#define mod 1000000007
int Solution::cntBits(vector<int> &A) {
    long long int s = 0, n = 32,
    ones=0, zeroes=0;

    while(n--) {
        ones =0; zeroes=0;
        for(int i = 0; i < A.size(); i++) {
            if(A[i]%2 == 1){
                ones++;
                //ones[n]=ones[n]%mod;
            }
            else{
                zeroes++;
               //in zeroes[n]=zeroes[n]%mod;
            }
            A[i] = A[i] / 2;

        }
        s += ones*zeroes;
        s = s%mod;
    }
    return (2 * s)%mod;
}