from collections import *
from itertools import *
from heapq import *
from functools import *
import sys,math
input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
M = len(bin(max(A)))-2
ans = ((1<<M) - 1)*N*(N+1)//2
for bit in range(M):
    X = []
    for i in range(N):
        X.append((A[i]>>bit)&1)
    
    for g,r in groupby(X):
        if g==0:
            n = len(list(r))
            ans -= (1<<bit)*n*(n+1)//2
print(ans)