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

typedef long long ll;
#define pa pair<int, int> 
#define pal pair<long long, long long>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define VIN(v) for(int64_t i=0;i<(v).size();i++){cin >> (v).at(i);}

typedef vector<bool> bvec;
typedef vector<int> ivec;
typedef vector<long long> lvec;
typedef vector<double> dvec;
typedef vector<pa> pvec;

typedef vector< vector<bool> > bmat;
typedef vector< vector<int> > imat;
typedef vector<string> svec;
typedef vector< vector<string> > smat;
const ll infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;

ll gcd(ll x, ll y){
    ll r = x%y;
    if(r == 0) return y;
    else return gcd(y, r);
} 

ll lcm(ll x, ll y){
    return x*y/gcd(x,y);
}

ll getnum(ivec &x){
    int y=0;
    for (size_t i = 0; i < 60; i++)
    {
        y+=(1ll << i)*x[i];
    }
    return y;

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, dm=60;
    cin >> n;
    lvec a(n);
    lmat s(dm);
    //ivec ss(60, 0);
    ivec ss;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < dm; i++){
        s[i].push_back((a[0] >> i) % 2);
        for (int j=1; j<n; j++){
            int d = (a[j] >> i) % 2;
            s[i].push_back(s[i][j-1] + d);
        }
    }
    for (auto &x : s){
        ss.push_back((n - x[n-1])*x[n-1]);
    }

    /*
    for (int i = 0; i < n-1; i++){
        for (int j=0; j<dm; j++){
            if((a[i] >> j)%2) ss[j] += (n-1-i) - (s[j][n-1] - s[j][i]);
            else ss[j] += (s[j][n-1] - s[j][i]);
        }
    }
    */

    ll d = 1e9 + 7;
    ll ans=0;
    for (int i = 0; i < dm; i++)
    {   
        ans += ((1ll << i)%d * ss[i]%d)%d;
    }
    
    cout << ans%d <<endl;

}