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 mod = 1000000007;
int N;
int v[1000010];
int cnt[20];
int pow(int x, int p) {
  int sol = 1;
  for (int i = 0; (1 << i) <= p; ++i) {
    if ((1 << i) & p) sol = 1LL * sol * x % mod;
    x = x * x % mod;
  }
  return sol;
}
int solve(int* v, int N) {
  int ret = 0, pivot, n = N;
  for (int k = 20; k >= 0; --k) {
    for (int i = 1; i <= N; ++i) cnt[k] += (v[i] & (1 << k)) != 0;
  }
  for (int k = 20; k >= 0; --k) {
    for (pivot = 1; pivot <= n && (v[pivot] & (1 << k)) == 0; ++pivot)
      ;
    ret += 1LL * (pow(2, n - pivot + 1) + mod - 1) *
           pow(2, cnt[k] - (n - pivot + 1)) % mod;
    n = pivot - 1;
  }
  return ret;
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) scanf("%d", &v[i]);
  sort(v + 1, v + N + 1);
  int rez = pow(2, N) - solve(v, N) - 1;
  while (rez < 0) rez += mod;
  while (rez >= mod) rez -= mod;
  printf("%d\n", rez);
  return 0;
}
