2
1 31
 2
1 0
 10
450661 128600 993228 725823 293549 33490 843121 903634 556169 448234
 1
1
 5
1 3 5 7 9
 6
524 529 5249 524 529 529
 3
1 2 3
 2
0 1
 55
0 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 3 4 5 6 7 8 9 4 5 6 7 8 9 5 6 7 8 9 6 7 8 9 7 8 9 8 9 9
 16
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
 3
128 1024 2048
 10
3 3 3 5 5 3 3 3 3 5
 1
0
 2
1 2
 2
0 0
 2
1 1

0
 2
 632
 0
 0
 24
 2
 2
 621247139
 64594
 4
 0
 1
 1
 3
 0

#include <bits/stdc++.h>
using namespace std;
const int N = 1000 * 1000 + 100;
const int M = 1000 * 1000 * 1000 + 7;
vector<int> a;
int p[N];
int n;
int doJob(const vector<int> b, int x) {
  if (x == 0) return p[((int)b.size())];
  x--;
  vector<int> c;
  for (int i = 0; i < ((int)b.size()); ++i)
    if ((b[i] >> x) & 1) c.push_back(b[i]);
  int ret = (-doJob(c, x - 1) + doJob(b, x - 1)) % M;
  ret = (ret + M) % M;
  return ret;
}
int main() {
  p[0] = 1;
  for (int i = 1; i < N; ++i) p[i] = 2 * p[i - 1] % M;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int t;
    scanf("%d", &t);
    a.push_back(t);
  }
  cout << doJob(a, 20) << "\n";
  return 0;
}
