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 S, typename T>
ostream& operator<<(ostream& out, pair<S, T> const& p) {
  out << '(' << p.first << ", " << p.second << ')';
  return out;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> const& v) {
  int l = v.size();
  for (int i = 0; i < l - 1; i++) out << v[i] << ' ';
  if (l > 0) out << v[l - 1];
  return out;
}
template <typename T>
void trace(const char* name, T&& arg1) {
  cout << name << " : " << arg1 << endl;
}
template <typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  trace(comma + 1, args...);
}
const long double PI = 3.1415926535897932384626433832795;
const int M = 3;
const int N = 1 << M;
const long long MOD = 1e9 + 7;
int n;
int a[N];
long long p[N];
long long dp[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  p[0] = 1;
  for (int i = 1; i < N; i++) {
    p[i] = p[i - 1] * 2 % MOD;
  }
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    dp[a[i]]++;
  }
  for (int j = M - 1; j >= 0; j--) {
    for (int i = N - 1; i >= 0; i--) {
      if ((i & (1 << j)) == 0) {
        dp[i] += dp[i ^ (1 << j)];
        if (dp[i] >= MOD) dp[i] -= MOD;
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < N; i++) {
    int c = __builtin_popcount(i);
    if (c % 2) {
      ans -= p[dp[i]];
      if (ans < 0) ans += MOD;
    } else {
      ans += p[dp[i]];
      if (ans >= MOD) ans -= MOD;
    }
  }
  cout << ans << endl;
  return 0;
}
