import bisect
n = int(input())
a = list(map(int, input().split()))
k = 28
ls = [[] for _ in range(k)]
for i in range(n):
  for j in range(k):
    if a[i] & (1 << j):
      ls[j].append(i)
ans = 0
for i in range(n):
  for j in range(k):
    if a[i] & (1 << j):
      ans += (n - i) * (1 << j)
      continue
    else:
      idx = bisect.bisect_right(ls[j], i)
      if idx < len(ls[j]):
        ans += (n - ls[j][idx]) * (1 << j)
print(ans)