#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
map<T, T> getPrimeFactor(T n) {
  map<T, T> res;
  for (T i = 2; i * i <= n; ++i) {
    while (n % i == 0) {
      res[i]++;
      n /= i;
    }
  }
  if (n != 1) res[n] = 1;
  return res;
}
template <typename T>
bool IsPrimeNumber(T num) {
  if (num <= 2)
    return true;
  else if (num % 2 == 0)
    return false;
  double sqrtNum = sqrt(num);
  for (int i = 3; i <= sqrtNum; i += 2) {
    if (num % i == 0) {
      return false;
    }
  }
  return true;
}
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}
ll pow2(ll n, ll p, ll mod) {
  if (p == 0 || n == 1) {
    return 1;
  } else {
    ll ret = pow2(n * n % mod, p / 2, mod);
    if (p % 2 == 1) {
      ret *= n;
    }
    return ret % mod;
  }
}
int main() {
  const ll mod = 1e9 + 7;
  ll N;
  std::cin >> N;
  vll A(N);
  vector<vll> cnt(N + 1, vll(60 + 1, 0));
  for (ll i = 0; i < N; i++) {
    std::cin >> A[i];
    for (ll j = 0; j <= 60; j++) {
      if (A[i] & (1LL << j)) {
        cnt[i][j]++;
      }
    }
    cnt[i + 1] = cnt[i];
  }
  ll ans = 0;
  for (ll i = 0; i < N; i++) {
    for (ll j = 0; j <= 60; j++) {
      ll tmp;
      if (A[i] & (1LL << j)) {
        tmp = N - i - 1 - cnt[N][j] + cnt[i][j];
      } else {
        tmp = cnt[N][j] - cnt[i][j];
      }
      ans += (tmp * (1LL << j)) % mod;
      ans %= mod;
    }
  }
  std::cout << ans << endl;
  return 0;
}
