def sumXOR( arr,  n): 
      
    sum = 0
    for i in range(0, 64): 
  
        zc = 0
        oc = 0
           
        idsum = 0
        for j in range(0, n): 
            if (arr[j] % 2 == 0): 
                zc = zc + 1
                  
            else: 
                oc = oc + 1
            arr[j] = int(arr[j] / 2) 
          
           
        idsum = oc * zc * (1 << i) 
   
        sum = sum + idsum;  
      
    return sum
mod = 1000000007
ans = 0
N = int(input())
nums = list(map(int, input().split()))
ans = sumXOR(nums, N);
print ( ans % mod)