#include <queue>
typedef long long ll;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

/*
y1 = x00 * x0 + x10 * x1 + ... + xn0 * xn
y2 = x01 * x0 + x11 * x1 + ... + xn1 * xn
...
yk = x0k * x0 + x1k * x1 + ... + xnk * xn

 */

int main(){
  const int n = getInt();
  vector<ll> a(n);
  REP(i,n) scanf("%lld", &a[i]);

  ll ans = 1;
  REP(i,62){
    int p = 0;
    for(; p < n; p++)
      if(a[p] & (1ll << i))
        break;
    if(p == n) continue;
    ans *= 2;

    REP(j,n) if(a[j] & (1ll << i)){
      a[j] = (a[j] ^ a[p]) | (1ll << i);
    }
  }

  printf("%lld\n", ans);

  return 0;
}