n = int(input())
a = list(map(int, input().split()))
total_subarrays = n * (n + 1) // 2
result = 0

for k in range(28):  # Process each bit from 0 to 27
    count_zero = 0
    current = 0
    for num in a:
        if (num & (1 << k)) == 0:
            current += 1
        else:
            count_zero += current * (current + 1) // 2
            current = 0
    # Add the last segment of zeros after loop ends
    count_zero += current * (current + 1) // 2
    contribution = (total_subarrays - count_zero) * (1 << k)
    result += contribution

print(result)