#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using unit = unsigned;
using vl = vector<ll>;
using ull = unsigned long long;
using vvi = vector<vi>;
using P = pair<int, int>;
using vvl = vector<vl>;
using vp = vector<P>;
void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}
template <class T>
string join(const vector<T> &v) {
  stringstream s;
  for (int i = (int)(0); i < (int)(((int)(v).size())); ++i) s << ' ' << v[i];
  return s.str().substr(1);
}
template <class T>
istream &operator>>(istream &i, vector<T> &v) {
  for (auto &x : v) {
    i >> v;
  }
  return i;
}
template <class T>
ostream &operator<<(ostream &o, const vector<T> &v) {
  o << "[";
  for (auto &x : v) o << x << ",";
  o << "]";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const deque<T> &v) {
  o << "deq[";
  for (auto &x : v) o << x << ",";
  o << "]";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const set<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_set<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const multiset<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_multiset<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T1, class T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
  o << "(" << p.first << "," << p.second << ")";
  return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const map<TK, TV> &m) {
  o << "{";
  for (auto &x : m) o << x.first << "=>" << x.second << ",";
  o << "}";
  return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const unordered_map<TK, TV> &m) {
  o << "{";
  for (auto &x : m) o << x.first << "=>" << x.second << ",";
  o << "}";
  return o;
}
template <class T>
void YES(T c) {
  if (c)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
template <class T>
void Yes(T c) {
  if (c)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
template <class T>
void POSS(T c) {
  if (c)
    cout << "POSSIBLE" << endl;
  else
    cout << "IMPOSSIBLE" << endl;
}
template <class T>
void Poss(T c) {
  if (c)
    cout << "Possible" << endl;
  else
    cout << "Impossible" << endl;
}
template <class T>
void chmax(T &a, const T &b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, const T &b) {
  if (b < a) a = b;
}
template <class T>
T gcd(T a, T b) {
  return (b == 0) ? a : gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = 1001002003;
const ll LINF = 1001002003004005006LL;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
void _main() {
  const ll mod = 1000000007;
  int N;
  cin >> N;
  vl A(N);
  ll ans = 0;
  for (int i = (int)(0); i < (int)(N); ++i) {
    cin >> A[i];
    for (int j = (int)(0); j < (int)(i); ++j) ans = (ans + (A[i] ^ A[j])) % mod;
  }
  cout << ans << endl;
}
