#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; 
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n;cin>>n;
    vector<ll> a(n);
    rep(i,n) cin>>a[i];

    //各位ごと右から累積和しておく
    ll sum0[n+1][100]={},sum1[n+1][100]={};
    for(int bit=0;bit<61;bit++){
        for(int i=n-1;i>=0;i--){
            if((a[i]>>bit)&1){
                sum1[i][bit]=sum1[i+1][bit]+1;
                sum0[i][bit]=sum0[i+1][bit];
            }else{
                sum0[i][bit]=sum0[i+1][bit]+1;
                sum1[i][bit]=sum1[i+1][bit];
            }
        }
    }
    ll ans=0,num=1;
    for(int bit=0;bit<61;bit++){
        rep(i,n){
            if((a[i]>>bit)&1){
                ans=(ans+(sum0[i+1][bit]* (num%mod)  )%mod)%mod;
            }else{
                ans=(ans+(sum1[i+1][bit]* (num%mod)  )%mod)%mod;
            }
        }
        num=(num*2)%mod;
    }
    cout<<ans<<endl;
    return 0;
}
