#include <bits/stdc++.h>
using namespace std;
void ans(bool x) {
  if (x)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
const long long int INF = 1001001001;
const int mod = 1000000007;
struct mint {
  long long int x;
  mint(long long int 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(long long int 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;
  long long int a[n];
  for (int i = 0; i < (int)(n); i++) {
    cin >> a[i];
  }
  int ans = 0;
  int m = 1;
  for (int i = 0; i < (int)(60); i++) {
    int a1 = 0, a0 = 0;
    for (int j = 0; j < (int)(n); j++) {
      if (a[j] >> i & 1) {
        a1 += 1;
        a1 % mod;
      }
      if (!(a[j] >> i & 1)) {
        a0 += 1;
        a0 % mod;
      }
    }
    ans += (a1 * a0) % mod * m % mod;
    m = (m * 2);
  }
  cout << ans << endl;
}
