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

using namespace std;
typedef long long LL;

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];
  sort(vi.rbegin(), vi.rend());

  int y = 0;
  for(int d=60;d>=0;--d){
	if(vi[y]>>d & 1){
	  for(int i=y+1;i<N;++i){
		if(vi[i]>>d & 1){
		  vi[i] ^= vi[y];
		}
		else break;
	  }
	  ++y;
	}
  }
  
  cout << (1LL << y) << endl;
  
  return 0;
}