#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

int main(){
	int n; cin >> n;
	vector<int> a(n);
	for (int i=0; i<n; i++) cin >> a[i];
	// shukyaku tentou
	// yo jishou
	ll ans = 0;
	for (int i=0; i<28; i++){
		vector<int> r(0);
		bool mode = false;
		int now = 0;
		for (int j=0; j<n; j++){
			if ((a[j] >> i & 1) == 0){
				if (mode){
					now++;
				}else{
					now=1;
					mode = true;
				}
			}else{
				if (mode){
					mode = false;
					r.push_back(now);
				}
			}
		}
		if (mode){
			r.push_back(now);
		}
		ans += ((ll)n*(n+1)/2) << (ll)i;
		for (int k: r){
			ll tmp = (ll)k*(k+1)/2;
			ans -= tmp << (ll)i;
		}
	}
	cout << ans << endl;
}