#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, ans=0;
    cin >> N;
    vector<ll> A(N);
    vector<vector<ll>> c(28);
    for (int i=0; i<N; i++){
        cin >> A[i];
        for (int j=0; j<28; j++){
            if (A[i] & 1<<j) c[j].push_back(i);
        }
    }

    for (int i=0; i<N; i++){
        for (int j=0; j<28; j++){
            auto it = lower_bound(c[j].begin(), c[j].end(), i);
            if (it == c[j].end()) continue;
            ans += (1LL<<j) * (N - *it);
        }
    }

    cout << ans << endl;

    return 0;
}