#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T>
constexpr T INF() {
  return ::std::numeric_limits<T>::max();
}
template <class T>
constexpr T HINF() {
  return INF<T>() / 2;
}
template <typename T_char>
T_char TL(T_char cX) {
  return tolower(cX);
};
template <typename T_char>
T_char TU(T_char cX) {
  return toupper(cX);
};
const int vy[] = {-1, -1, -1, 0, 1, 1, 1, 0},
          vx[] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int popcnt(unsigned long long n) {
  int cnt = 0;
  for (int i = 0; i < 64; i++)
    if ((n >> i) & 1) cnt++;
  return cnt;
}
int d_sum(LL n) {
  int ret = 0;
  while (n > 0) {
    ret += n % 10;
    n /= 10;
  }
  return ret;
}
int d_cnt(LL n) {
  int ret = 0;
  while (n > 0) {
    ret++;
    n /= 10;
  }
  return ret;
}
LL gcd(LL a, LL b) {
  if (b == 0) return a;
  return gcd(b, a % b);
};
LL lcm(LL a, LL b) {
  LL g = gcd(a, b);
  return a / g * b;
};
struct INIT {
  INIT() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    cout << fixed << setprecision(13);
  }
} INIT;
LL n;
LL a[303030];
LL bitcnt[64];
const LL mod = 1e9 + 7;
int main() {
  cin >> n;
  for (LL i = (0); i < (n); i++) {
    cin >> a[i];
    for (LL j = (0); j < (64); j++) {
      if ((1LL << j) & a[i]) bitcnt[j]++;
    }
  }
  LL ans = 0;
  for (LL i = (0); i < (64); i++) {
    LL num = bitcnt[i] * (n - bitcnt[i]) % mod;
    (ans += num * (1LL << i)) %= mod;
  }
  cout << ans << endl;
}
