#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
const int N = 2e5 + 10;
ll aarray[300000 + 10];
ll magic[101][101];
vector<ll> primes;
bool prime[1000001];
ll chkbit(ll n, ll k) { return n & (1LL << k); }
int main() {
  ios_base::sync_with_stdio(false);
  string str;
  ll a, b, c, d, e, f, x, y, k, t, A = 0, mod, B = 0, L, j, i, l, r, m, n,
                                   C = 0, ans = 0, sum = 0, sum1 = 0;
  vector<ll> v, v1;
  queue<ll> qu;
  cin >> n;
  for (i = 0; i < n; i++) cin >> aarray[i];
  for (i = 0; i < 64; i++) {
    ll cnt = 0;
    for (j = 0; j < n; j++) {
      if (chkbit(aarray[j], i)) cnt++;
    }
    ans = (ans + (cnt * (n - cnt)) * (1LL << i)) % 1000000007;
  }
  cout << ans << endl;
  return 0;
}
