#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int mod = 1000000007;
int main(void) {
  ll n;
  cin >> n;
  vector<ll> a(n);
  for (int i = 0; i < (n); i++) cin >> a[i];
  ll ans = 0;
  for (int i = 0; i < (60); i++) {
    ll x = 0;
    for (int j = 0; j < (n); j++)
      if (a[j] >> i & 1) x++;
    ll now = x * (n - x) % mod;
    for (int j = 0; j < (i); j++) now = now * 2 % mod;
    ans += now;
    ans %= mod;
  }
  return 0;
}
