#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
template <class T>
struct edge {
  int from, to;
  T cost;
};
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline T powerM(T a, T b) {
  if (b == 0) return 1;
  T tmp = powerM(a, b / 2);
  if (b % 2 == 0)
    return tmp * tmp % MOD;
  else
    return tmp * tmp % MOD * a % MOD;
}
template <class T>
inline T power(T a, T b, T m) {
  if (b == 0) return 1;
  T tmp = power(a, b / 2, m);
  if (b % 2 == 0)
    return tmp * tmp % m;
  else
    return tmp * tmp % m * a % m;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
inline T extgcd(T a, T b, T &x, T &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  T d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
void hey() { cout << "hey" << endl; }
int N;
vector<ll> A;
void input() {
  cin >> N;
  A.assign(N, 0);
  for (int i = 0; i < (int)(N); i++) cin >> A[i];
}
void solve1(vector<vector<int>> &bit) {
  for (int i = 0; i < (int)(N); i++) {
    ll a = A[i];
    for (int j = 0; j < 100; j++) {
      int bi2 = a % 2;
      bit[j][bi2]++;
      a /= 2;
    }
  }
}
int main() {
  input();
  vector<vector<int>> bit(100, vector<int>(2, 0));
  solve1(bit);
  ll co2 = 1;
  ll res = 0;
  for (int i = 0; i < (int)(100); i++) {
    ll tmp = bit[i][0] * bit[i][1] % MOD;
    res = (res + tmp * co2 % MOD) % MOD;
    co2 = co2 * 2 % MOD;
  }
  cout << res << endl;
}
