#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;

int main() {
  int n;
  cin >> n;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  ll ans = 0;
  rep(i, 60) {
    ll x = 0;
    rep(j, n) if (a[j]&(1ll<<i)) x++;
    ll t = x * (n - x) % mod;
    rep(j, i) t *= 2, t %= mod;
    ans += t;
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}