N = int(input())
A = [int(i) for i in input().split()]
s = 0
c = 1
while max(A) != 0:
    #print(max(A))
    s0 = 0
    s1 = 0
    for i,j in enumerate(A):
        if True:
            A[i],mod = divmod(j,2)
            #print(mod)
            if mod==1:
                s1 +=1
            else:
                s0 +=1
        #print(s0,s1)
    s = (s+(s0*s1*c))%(10**9+7)
    c *= 2
print(s)