#include <bits/stdc++.h>
using namespace std;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
const int mod = 1e9 + 7;
using modint = ModInt<mod>;
int main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (int i = int(0); i < int(n); ++i) {
    scanf("%lld", &a[i]);
  }
  vector<long long> z(60, 0);
  for (int i = int(0); i < int(n); ++i) {
    long long p = a[i];
    for (int j = int(0); j < int(60); ++j) {
      if (p % 2) {
        z[j]++;
      }
      p /= 2;
    }
  }
  modint ans = 0;
  long long ctr = n;
  for (int i = int(0); i < int(n - 1); ++i) {
    long long p = a[i];
    vector<long long> q(60, 0);
    for (int j = int(0); j < int(60); ++j) {
      if (p % 2) {
        q[j]++;
      }
      p /= 2;
    }
    for (int j = int(0); j < int(60); ++j) {
      if (q[j]) {
        z[j]--;
      }
    }
    ctr--;
    for (int j = int(0); j < int(60); ++j) {
      if (q[j]) {
        ans += 1ll * (ctr - z[j]) * (1ll << j);
      } else {
        ans += 1ll * z[j] * (1ll << j);
      }
    }
    cout << ans << endl;
  }
  cout << ans << endl;
}
