#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
  char buffer[4];
  std::snprintf(buffer, sizeof(buffer), "%03d", num);
  return buffer;
}
inline ll randint(ll a, ll b) {
  ll w = (_g() << 31LL) ^ _g();
  return a + w % (b - a + 1);
}
inline void fast_io() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
};
template <typename T>
inline T sign(T x) {
  return T(x > 0) - T(x < 0);
}
template <typename T, typename S>
inline ostream& operator<<(ostream& os, const pair<T, S> p) {
  cout << "[" << p.first << ";" << p.second << "]";
  return os;
}
template <typename T>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto el : v) cout << el << " ";
  return os;
}
template <typename T>
inline T fetch() {
  T ret;
  cin >> ret;
  return ret;
}
template <typename T>
inline vector<T> fetch_vec(int sz) {
  vector<T> ret(sz);
  for (auto& elem : ret) cin >> elem;
  return ret;
}
int solve() {
  const int mod = 10e9 + 7;
  int n;
  cin >> n;
  vector<ull> v = fetch_vec<ull>(n);
  ull sum = 0;
  for (int bit = 0; bit <= 60; ++bit) {
    int ones = 0;
    int zeroes = 0;
    ull molt = (1 << bit) % mod;
    for (int i = n - 1; i >= 0; --i) {
      if ((v[i] & (1LL << bit)) != 0)
        ++ones;
      else
        ++zeroes;
    }
    sum = (sum + (ones * zeroes * molt % mod)) % mod;
  }
  cout << sum << endl;
  return 0;
}
int main() {
  solve();
  return 0;
}
