def XOR( arr, n): 
	sum = 0
	for i in range(0, 64): 
		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 = (sum%mod + idsum%mod)%mod; 
	return sum%mod
mod = 10**9+7
n = int(input())
ls = list(map(int,input().strip().split()))
print(XOR(ls, n))
