#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_LARGE = 1000000100;
template <typename T>
void vecprint(vector<T> v) {
  for (auto x : v) {
    cerr << x << " ";
  }
  cerr << endl;
}
template <typename T>
void vecvecprint(vector<vector<T>> vv) {
  for (int i = (0); i < (int((vv).size())); ++i) {
    for (int j = (0); j < (int((vv[i]).size())); ++j) {
      cerr << vv[i][j] << " ";
    }
    cerr << endl;
  }
}
template <typename T>
void pqprint(priority_queue<T> q) {
  while (!q.empty()) {
    cerr << q.top() << " ";
    q.pop();
  }
  cerr << endl;
}
template <typename T>
void qprint(queue<T> q) {
  while (!q.empty()) {
    cerr << q.front() << " ";
    q.pop();
  }
  cerr << endl;
}
template <typename T>
void vecqprint(vector<queue<T>> v) {
  for (int i = 0; i < v.size(); i++) {
    qprint(v[i]);
  }
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
                             const Iterator last) {
  if ((first == last) || (first == k) || (last == k)) return false;
  Iterator itr1 = first;
  Iterator itr2 = last;
  ++itr1;
  if (last == itr1) return false;
  itr1 = last;
  --itr1;
  itr1 = k;
  --itr2;
  while (first != itr1) {
    if (*--itr1 < *itr2) {
      Iterator j = k;
      while (!(*itr1 < *j)) ++j;
      iter_swap(itr1, j);
      ++itr1;
      ++j;
      itr2 = k;
      rotate(itr1, j, last);
      while (last != j) {
        ++j;
        ++itr2;
      }
      rotate(k, itr2, last);
      return true;
    }
  }
  rotate(first, k, last);
  return false;
}
inline double get_time_sec(void) {
  return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(
                                 chrono::steady_clock::now().time_since_epoch())
                                 .count()) /
         1000000000;
}
template <typename T>
T gcd(T a, T b) {
  if (a > b) swap(a, b);
  if (a == 0)
    return b;
  else
    return gcd(b % a, a);
}
template <typename T>
map<T, T> prime_list(T n) {
  map<T, T> ret;
  for (T i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      ret[i] = 0;
      while (n % i == 0) {
        n /= i;
        ret[i]++;
      }
    }
  }
  if (n != 1) ret[n]++;
  return ret;
}
int main(void) {
  long long n;
  cin >> n;
  vector<vector<long long>> a(n, vector<long long>(60, 0));
  vector<long long> cnt0(60, 0), cnt1(60, 0);
  for (int i = (0); i < (n); ++i) {
    long long tmp;
    cin >> tmp;
    for (int j = (0); j < (61); ++j) {
      if ((long long)1 << j & tmp) {
        a[i][j] = 1;
        cnt1[j]++;
      } else {
        cnt0[j]++;
      }
    }
  }
  long long ans = 0;
  for (int i = (0); i < (61); ++i) {
    long long tmp = cnt0[i] * cnt1[i];
    tmp %= 1000000007;
    tmp *= (long long)1 << i;
    tmp %= 1000000007;
    ans += tmp;
    ans %= 1000000007;
  }
  cout << ans << endl;
}
