#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vi a(n); rep(i, n)cin >> a[i];
    vector<bitset<28>> vb(n);
    rep(i, n){
        bitset<28> bs(a[i]);
        vb[i] = bs;
    }
    ll ans = 0;
    rep(i, 28){
        ll tmp = n*(n+1)/2;
        bool t = vb[0][i];
        ll l = 1;
        rep2(j, 1, n){
            if(vb[j][i]){
                if(!t){
                    tmp -= l*(l+1)/2;
                    l = 0;
                    t = true;
                }
            }else{
                if(t){
                    t = false;
                    l = 1;
                }else{
                    l++;
                }
            }
        }
        if(!t)tmp -= l*(l+1)/2;
        ans += tmp*(ll)pow(2, i);
    }cout << ans << endl;

    return 0;
}