#include <bits/stdc++.h>
using namespace std;
template <typename T>
void print(const T& v) {
  cerr << v << ' ';
}
template <typename T1, typename... T2>
void print(const T1& first, const T2&... rest) {
  print(first);
  print(rest...);
}
typedef priority_queue<pair<int, int>, vector<pair<int, int> >,
                       greater<pair<int, int> > >
    pq;
int setbit(int N, int pos) { return N = N | (1 << pos); }
int resetbit(int N, int pos) { return N = N & ~(1 << pos); }
bool checkbit(long long N, int pos) { return (bool)(N & (1LL << pos)); }
int nextN(int N) { return N + (N & (-N)); }
int parentN(int N) { return N - (N & (-N)); }
template <typename T>
T extGcd(T a, T b, T& x, T& y) {
  if (a == 0) {
    x = 0, y = 1;
    return b;
  }
  T x1, y1, gcd = extGcd(b % a, a, &x1, &y1);
  x = y1 - (b / a) * x1, y = x1;
  return gcd;
}
template <typename T>
T bigMod(T a, T p, T m) {
  if (p == 1) return a;
  T x = bigMod(a, p / 2, m) % m;
  x = (x * x) % m;
  return (p & 1) ? (x * a) % m : x;
}
template <typename T>
T modMul(T a, T b, T m) {
  return ((a % m) * (b % m)) % m;
}
template <typename T>
T modAdd(T a, T b, T m) {
  return ((a % m) + (b % m)) % m;
}
template <typename T>
T modSub(T a, T b, T m) {
  return (a - b + m) % m;
}
template <typename T>
T modInverse(T a, T m) {
  return bigMod(a, m - 2, m);
}
const long long mod = 1e9 + 7;
int zero[63], one[63];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    long long x;
    cin >> x;
    for (int j = 0; j <= 62; ++j) {
      int c = checkbit(x, j);
      if (c == 1)
        one[j]++;
      else
        zero[j]++;
    }
  }
  long long ans = 0;
  for (int j = 0; j <= 62; ++j) {
    long long v = 1LL << j;
    long long cnt = zero[j] * one[j];
    ans = modAdd(ans, modMul(v, cnt, mod), mod);
  }
  cout << ans;
  return 0;
}
