#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>

using namespace::std;




int main() {
  ios::sync_with_stdio(false);
  long long n, r = 0;
  cin >> n;
  vector<long long> prev(30, -1); 
  for (int i = 0; i < n; ++i) {
    long long a;
    cin >> a;
    for (long long j = 0; a; ++j, a >>= 1)
      if (a & 1) {
        r +=  (i - prev[j]) * (n - i) << j;
        prev[j] = i;
      }
  }
  
  cout << r << endl;

  
  return 0;
}