#include <iomanip>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long LL;

string b(LL x){
  string s;
  for(int i=20;i>=0;--i)
	if(x>>i&1) s += "1";
	else s += "0";
  return s;
}

int main(){
  cin.sync_with_stdio(false);
  cin.tie(0);
  
  int N; cin >> N;
  vector<LL> vi(N);
  for(int i=0;i<N;++i)cin>>vi[i];

  LL cnt = 0;
  vector<bool> used(N, false);
  for(int d=60;d>=0;--d){
	int k = -1;
	for(int i=0;i<N;++i){
	  if((vi[i]>>d) & 1LL){
		if(k < 0 && !used[i]){
		  k = i; ++cnt; used[i] = true;
		}
		else{
		  vi[i] ^= vi[k];
		}
	  }
	}
  }
  
  cout << (1LL << cnt) << endl;
  
  return 0;
}