def sumXOR( arr,  n): 
  sum = 0
  for i in range(0, 60): 
    #  Count of zeros and ones 
    zc = 0
    oc = 0
    # Individual sum at each bit position 
    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) 
    # calculating individual bit sum  
    idsum = oc * zc * (1 << i) 
   
    # final sum     
    sum += idsum
    sum %= 1000000007
      
  return sum
  
n = int(input())
arr = [int(i) for i in input().split()]
# driver function  
sum=0
sum = sumXOR(arr, n); 
print (int(sum % (1000000007))) 