#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long longinf = 1LL << 60;
const int mx = 200010;
const long long mod = 1e9 + 7;
int main() {
  int n;
  long long ans = 0;
  cin >> n;
  vector<unsigned long long> a(n);
  for (int i = (int)(0); i < (int)(n); ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      ans += a[i] ^ a[j];
      ans %= mod;
    }
  }
  cout << ans << endl;
  return 0;
}
