#include <bits/stdc++.h>
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  return a > b && (a = b, true);
}
long long pow_mod(long long a, long long b, long long mod = -1) {
  if ((a == 0) || (mod != -1 && a % mod == 0)) {
    return 0;
  }
  long long x = 1;
  while (b > 0) {
    if (b & 1) {
      x = (mod != -1) ? (x * a) % mod : x * a;
    }
    a = (mod != -1) ? (a * a) % mod : a * a;
    b >>= 1;
  }
  return x;
}
const long long MOD = 1e9 + 7;
using ll = long long;
using P = std::pair<ll, ll>;
int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  ll n;
  std::cin >> n;
  std::vector<ll> zero(60, 0), one(60, 0);
  for (long long(i) = (0); i < (n); i++) {
    ll a;
    std::cin >> a;
    for (long long(j) = (0); j < (60); j++) {
      if ((a >> j) & 1)
        one[j]++;
      else
        zero[j]++;
    }
  }
  ll ans = 0;
  for (long long(i) = (0); i < (60); i++) {
    ans = (ans + ((1ll << i) * ((zero[i] * one[i]) % MOD)) % MOD) % MOD;
  }
  std::cout << ans << "\n";
  return 0;
}
