#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 28;
const int mod = (int)1e9 + 7;
int n, m, k;
int dp[1 << 20];
long long p[1000010];
int main() {
  cin >> n;
  int x;
  p[0] = 1;
  for (int i = 1; i <= n; i++) {
    p[i] = p[i - 1] * 2 % mod;
    scanf("%d", &x);
    dp[x]++;
  }
  for (int i = 0; i < 20; i++) {
    for (int j = 0; j < (1 << 20); j++) {
      if (j >> i & 1) dp[j - (1 << i)] += dp[j];
    }
  }
  long long ans = p[n];
  for (int i = 1; i < (1 << 20); i++) {
    int num = __builtin_popcount(i);
    if (num & 1)
      ans += mod - p[dp[i]];
    else
      ans += p[dp[i]];
    if (ans >= mod) ans -= mod;
  }
  cout << ans << endl;
  return 0;
}
