#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) cin >> A[i];
    ll ans = 0;
    for (ll d = 0; d < 28; d++) {
        ll tmp = (N * (N + 1)) / 2;
        ll c = 0;
        for (ll i = 0; i <= N; i++) {
            if (i == N || (A[i] & (1 << d)) != 0) {
                tmp -= (c * (c + 1)) / 2;
                c = 0;
            } else {
                c++;
            }
        }
        ans += tmp * (1LL << d);
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    solve();
}