#include <bits/stdc++.h>
using namespace std;
const int MAX = 310000;
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() {
  COMinit();
  int n;
  cin >> n;
  vector<long long> a(n);
  for (auto& e : a) cin >> e;
  long long sum = 0;
  int cnt[60] = {};
  for (int i = 0; i < n; ++i) {
    (sum += (n - 1) * a[i]) %= MOD;
  }
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < 60; ++j)
      if (a[i] & (1LL << j)) cnt[j]++;
  long long mul = 1;
  for (int i = 0; i < 60; ++i) {
    if (cnt[i] > 1) sum -= ((mul * COM(cnt[i], 2) % MOD) * 2) % MOD;
    sum = (sum % MOD + MOD) % MOD;
    (mul *= 2) %= MOD;
  }
  cout << sum << endl;
  return 0;
}
