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;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto i : v) os << i << " ";
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  for (auto i : v) os << i << " ";
  return os;
}
const long long MOD = 1e9 + 7;
const int N = 1048580;
long long f[N];
long long fp(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) {
      res *= x;
      res %= MOD;
    }
    x *= x;
    x %= MOD;
    y >>= 1;
  }
  return res;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    ++f[x];
  }
  for (int i = 0; i < 20; ++i)
    for (int j = (1 << 20) - 1; ~j; --j)
      if (~j & (1 << i)) f[j] = f[j] + f[j | (1 << i)];
  for (int i = 0; i < (1 << 20); ++i) f[i] = fp(2, f[i]);
  for (int i = 0; i < 20; ++i)
    for (int j = (1 << 20) - 1; ~j; --j)
      if (~j & (1 << i)) f[j] = f[j] - f[j | (1 << i)];
  printf("%I64d\n", f[0]);
  return 0;
}
