#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

int main(){
	int n;
	cin >> n;
	vector<long long> a(n);
	for(int i=0; i<n; i++){
		cin >> a[i];
	}

	int rank = 0;
	long long row = 0;
	for(int col=0; col<64; col++){
		int pivot = row;
		while( ((a[pivot] >> col) & 1) == false && pivot < n) pivot++;
		if( pivot >= n || ((a[pivot] >> col) & 1) == false ) continue;
		swap(a[row], a[pivot]);
		for(int i=row+1; i<n; i++){
			if(a[i] >> col & 1) a[i] ^= a[row];
		}

		row++;
		rank++;
	}

	cout << (1LL<<rank) << endl;

	return 0;
}