#include <bits/stdc++.h>
using namespace std;
int orSumOfPairs(int arr[] , int n){
int ans = 0;
for(int i=0;i<32;i++){
int countOne=0;
int mask = (1<<i);
if(arr[0] & mask)countOne++;
for(int j=1;j<n;j++){
int goodPair = 0;
if(arr[j] & mask){
countOne++;
goodPair = j;
}
else{
goodPair = countOne;
}
ans += (1<<i)*goodPair;
}
}
return ans;
}
int main() {
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
cout<<orSumOfPairs(arr,n);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKaW50IG9yU3VtT2ZQYWlycyhpbnQgYXJyW10gLCBpbnQgbil7CglpbnQgYW5zID0gMDsKCQoJZm9yKGludCBpPTA7aTwzMjtpKyspewoJCWludCBjb3VudE9uZT0wOwoJCWludCBtYXNrID0gKDE8PGkpOwoJCWlmKGFyclswXSAmIG1hc2spY291bnRPbmUrKzsKCQlmb3IoaW50IGo9MTtqPG47aisrKXsKCQkJaW50IGdvb2RQYWlyID0gMDsKCQkJaWYoYXJyW2pdICYgbWFzayl7CgkJCQljb3VudE9uZSsrOwoJCQkJZ29vZFBhaXIgPSBqOwoJCQl9CgkJCWVsc2V7CgkJCQlnb29kUGFpciA9IGNvdW50T25lOwoJCQl9CgkJCWFucyArPSAoMTw8aSkqZ29vZFBhaXI7CgkJfQoJfQoJcmV0dXJuIGFuczsKfQoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIGNpbj4+bjsKICAgIGludCBhcnJbbl07CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKXsKICAgIAljaW4+PmFycltpXTsKICAgIH0KCgljb3V0PDxvclN1bU9mUGFpcnMoYXJyLG4pOwoJCiAgICByZXR1cm4gMDsKfQo=