#include <bits/stdc++.h>
using namespace std;
const int mxlg = 21, MAXX = (1 << mxlg), MOD = 1e9 + 7;
int n, pw2[MAXX], dp[MAXX][mxlg], ans;
int sum(int x, int y) { return ((((x + y) % MOD) + MOD) % MOD); }
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n, pw2[0] = 1;
  for (int i = 1; i < MAXX; i++) pw2[i] = (pw2[i - 1] * 2) % MOD;
  for (int i = 0, x; i < n; i++) cin >> x, dp[x][0]++;
  for (int mask = 1; mask < mxlg; mask++) {
    for (int i = 0; i < MAXX; i++) {
      dp[i][mask] = dp[i][mask - 1];
      if (!(i & (1 << (mask - 1))))
        dp[i][mask] = (dp[i][mask] + dp[i + (1 << (mask - 1))][mask - 1]);
    }
  }
  for (int i = 0; i < MAXX; i++) {
    int x = __builtin_popcount(i), y = pow(-1, x);
    ans = sum(ans, (y * pw2[dp[i][mxlg - 1]]));
  }
  return cout << ans << endl, 0;
}
