#include <bits/stdc++.h>
using namespace std;
int get(int n, int p) {
  int res = 0;
  while (n >= p) res += n / p, n /= p;
  return res;
}
template <class T>
T power(T N, T P) {
  return (P == 0) ? 1 : N * power(N, P - 1);
}
void VC(vector<long long int>& v) {
  for (int i = 0; i < v.size(); i++) printf("%lld ", v[i]);
  printf("\n");
}
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...);
}
long long BigMod(long long int a, long long int b, int M) {
  long long remainder, answer = 1;
  remainder = a % M;
  while (b != 0) {
    if (b % 2 == 1) answer = (answer * remainder) % M;
    remainder = (remainder * remainder) % M;
    b /= 2;
  }
  return answer;
}
bool cmp(int a, int b) { return a > b; }
unsigned long long int n;
unsigned long long int arr[300005];
unsigned long long int sumXOR() {
  unsigned long long int sum = 0ll, zc, idsum, oc;
  for (int i = 0; i < 64; i++) {
    zc = 0ll, oc = 0ll;
    idsum = 0ll;
    for (long long int j = 0; j < n; j++) {
      if (arr[j] % 2ll == 0ll)
        zc++;
      else
        oc++;
      arr[j] /= 2ll;
    }
    idsum = (oc * zc);
    idsum = ((idsum * ((1ll << i))));
    sum = ((sum) + (idsum)) % 1000000007;
  }
  return sum;
}
int main() {
  unsigned long long int sum = 0ll;
  cin >> n;
  for (long long int i = 0ll; i < n; i++) scanf("%llu", &arr[i]);
  sum = sumXOR();
  cout << sum << endl;
  return 0;
}
