#include <bits/stdc++.h>
using namespace std;
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
int main() {
  int N;
  cin >> N;
  vector<long long> A(N);
  for (int n = 0; n < N; ++n) {
    cin >> A[n];
  }
  vector<mint> MOD(60);
  mint tmp = 1;
  for (int n = 0; n < 60; ++n) {
    MOD[n] = tmp;
    tmp *= 2;
  }
  mint ans = 0;
  for (int n = 0; n < 60; ++n) {
    int num = 0;
    for (int m = 0; m < N; ++m) {
      if (1 == ((A[m] >> n) & 1)) {
        num++;
      }
    }
    num = (N - num) * num;
    ans += MOD[n] * (mint)num;
  }
  cout << ans << endl;
  return 0;
}
