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