// D - Xor Sum 4
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rp(i,s,e) for(int i=(s);i<(e);++i)
#define MOD 1000000007
 
ll O[60];

ll in(){ll x; scanf("%lld",&x); return x;}

int main(){
	int N; cin>>N;
	rp(i,0,N){ for(ll j=0, a=in(); a; a>>=1) O[j++]+=a&1; }
	ll ans = 0;
	rp(i, 0, 60) ans = (ans + (O[i]*(N-O[i]) % MOD) * ((1LL<<i) % MOD)) % MOD;
	cout<< ans <<endl;
}