#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
  if (a.first != b.first) {
    return a.first < b.first;
  } else {
    return a.second < b.second;
  }
}
const int MAX = 2000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
  int N;
  cin >> N;
  vector<long long> A(N);
  vector<long long> bit(62);
  for (int i = 0; i < 62; i++) {
    bit[i] = 0;
  }
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  for (int r = 0; r < N; r++) {
    for (long long i = 0; i < 62; ++i) {
      if (A[r] & ((long long)pow(2, i))) {
        bit[i]++;
      }
    }
  }
  long long ans = 0;
  for (long long i = 0; i < 62; ++i) {
    long long po = pow(2, i);
    po = po % MOD;
    ans += po * bit[i] * (N - bit[i]);
    ans = ans % MOD;
  }
  cout << ans << endl;
}
