//得意
#include <iostream>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n;
int a[200000];
int minR[28][200001];

signed main() {
	int i, j;

	cin >> n;
	rep(i, n) cin >> a[i];

	rep(i, 28) {
		minR[i][n] = n;
		for (j = n - 1; j >= 0; j--) {
			if ((a[j] >> i) % 2 == 1) {
				minR[i][j] = j;
			}
			else {
				minR[i][j] = minR[i][j + 1];
			}
		}
	}

	int ans = 0;
	rep(i, 28) {
		int cnt = 0;
		rep(j, n) {
			cnt += n - minR[i][j];
		}
		ans += cnt * (1LL << i);
	}

	cout << ans << endl;
	return 0;
}