#include <bits/stdc++.h>
using namespace std;
long long modpow(long long x, long long y,
                 long long m = (long long)(1000000007)) {
  long long res = 1;
  while (y) {
    if (y % 2) {
      res *= x;
      res %= m;
    }
    x = x * x % (long long)(1000000007);
    y /= 2;
  }
  return res;
}
long long mypow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y % 2) {
      res *= x;
    }
    x = x * x;
    y /= 2;
  }
  return res;
}
bool prime(long long x) {
  for (long long i = 2; i * i <= x; i++) {
    if (!(x % i)) {
      return false;
    }
  }
  return true;
}
inline long long gcd(long long x, long long y) {
  if (!y) {
    return x;
  }
  return gcd(y, x % y);
}
long long keta(long long x) {
  long long ans = 0;
  while (x) {
    x /= 10;
    ans++;
  }
  return ans;
}
long long ketasum(long long x) {
  long long ans = 0;
  while (x) {
    ans += x % 10;
    x /= 10;
  }
  return ans;
}
inline long long lcm(long long x, long long y) {
  long long ans = x / gcd(x, y) * y;
  return ans;
}
long long twobeki(long long x) {
  long long ans = 0;
  while (1) {
    if (!(x & 1)) {
      ans++;
      x /= 2;
    } else {
      break;
    }
  }
  return ans;
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
template <class T>
class LazySegTree {
  long long n;
  vector<T> data;
  vector<T> lazy;
  T def;
  function<T(T, T)> operation;
  function<T(T, T)> update;
  T _query(long long a, long long b, long long k, long long l, long long r) {
    if (r <= a || b <= l) return def;
    if (a <= l && r <= b)
      return data[k];
    else {
      T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
      T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
      return operation(c1, c2);
    }
  }

 public:
  LazySegTree(size_t _n, T _def, function<T(T, T)> _operation,
              function<T(T, T)> _update)
      : def(_def), operation(_operation), update(_update) {
    n = 1;
    while (n < _n) {
      n *= 2;
    }
    data = vector<T>(2 * n - 1, def);
  }
  void change(long long i, T x) {
    i += n - 1;
    data[i] = update(data[i], x);
    while (i > 0) {
      i = (i - 1) / 2;
      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
    }
  }
  void change(long long i, long long j, T x) {
    i += n - 1;
    data[i] = update(data[i], x);
    while (i > 0) {
      i = (i - 1) / 2;
      data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
    }
  }
  T query(long long a, long long b) { return _query(a, b, 0, 0, n); }
  T operator[](long long i) { return data[i + n - 1]; }
};
long long n, k, a[300004], ans, cnt[104], cnt2[104];
signed main() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    for (long long j = 0; j < 63; j++) {
      if (a[i] & mypow(2, j)) {
        cnt[j]++;
      } else {
        cnt2[j]++;
      }
    }
  }
  for (long long i = 0; i < 63; i++) {
    ans += (mypow(2, i)) * cnt[i] * cnt2[i] % (long long)(1000000007);
    ans %= (long long)(1000000007);
  }
  cout << ans << endl;
}
