#include <bits/stdc++.h>
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<ll> a(n);
  for (int i = (int)0; i < (int)n; ++i) cin >> a[i];
  ll ans = 0;
  for (ll i = 0; i < 60; ++i) {
    ll one = 0, zero = 0;
    for (int j = (int)0; j < (int)n; ++j) {
      if (a[j] & 1)
        ++one;
      else
        ++zero;
      a[j] >>= 1;
    }
    ll calc = 0;
    calc = (zero * one) % mod;
    calc <<= i;
    calc %= mod;
    ans += calc;
    ans %= mod;
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
