#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}
//ランレングス圧縮
vector<pair<char, long long>> encode(const string &str){
  int n=(int)str.size();
  vector<pair<char, long long>> ret; // 答えを格納
  for (int l = 0; l < n;) {
    int r = l + 1;
    for (; r < n && str[l] == str[r]; r++) {};
    ret.push_back({str[l], r-l});
    l = r;
  }
  return ret;
}
const ll MOD=998244353;
const ll INF=(1ll<<60);
int main(){
  ll N;
  cin>>N;
  vl A(N);
  rep(i,N) cin>>A[i];
  ll fina=0;
  rep(i,28){
    vl A2(N+1,1);
    rep(j,N) A2[j]=(A[j]>>i)%2;
    ll ans=0;
    ll next=0;
    ll sum=0;
    while(next<N+1){
      if(A2[next]==1){
        ans+=(sum*(sum+1))/2;
        next++;
        sum=0;
      }
      else{
        sum++;
        next++;
      }
    }
    fina+=(1<<i)*((N*(N+1))/2-ans);
  }
  cout<<fina<<endl;
}