#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
const ll INF = 1e9 + 7;
int gcd(int x, int y) {
  if (x < y) swap(x, y);
  if (y == 0) return x;
  return gcd(y, x % y);
}
template <class T1, class T2>
void chmin(T1 &a, T2 b) {
  if (a > b) a = b;
}
template <class T1, class T2>
void chmax(T1 &a, T2 b) {
  if (a < b) a = b;
}
template <class T>
void Add(T &a, const T &b, const T &mod = 1000000007) {
  int val = ((a % mod) + (b % mod)) % mod;
  if (val < 0) {
    val += mod;
  }
  a = val;
}
ll A[300100];
int main() {
  ll N;
  cin >> N;
  for (int i = (0); i <= (N - 1); i++) cin >> A[i];
  ll cnt[61];
  for (int i = (0); i <= (61 - 1); i++) cnt[i] = 0;
  for (ll i = 0; i < N; ++i) {
    for (ll j = 0; j < 61; ++j) {
      if ((A[i] & ll(1LL << j))) {
        cnt[j]++;
      }
    }
  }
  ll ans = 0;
  for (ll i = 0; i < 60; ++i) {
    if (cnt[i] != 0) {
      ll x = 1LL << i;
      ans += (ll(N - cnt[i]) % INF) * ((cnt[i]) * (x) % INF);
      ans %= INF;
    }
  }
  cout << ans << endl;
  return 0;
}
