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

int main() {
  ll n;
  cin >> n;
  vector<ll> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  ll sum = 0;
  for (int bit = 0; bit < 28; bit++) {
    vector<ll> pos;
    pos.push_back(-1);
    for (int i = 0; i < n; i++) {
      if (a[i] & (1LL << bit)) pos.push_back(i);
    }
    pos.push_back(n);
    ll cnt = n * (n + 1) / 2;
    for (int i = 0; i + 1 < pos.size(); i++) {
      ll k = pos[i + 1] - pos[i] - 1;
      cnt -= k * (k + 1) / 2;
    }
    sum += (1LL << bit) * cnt;
  }
  cout << sum << "\n";
}