#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;

#define N 100000
ll d[N];

int main(){
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) scanf("%ld", d+i);
	int cnt = 0;
	for(int i = 0; i <= 60; i++){
		ll b = 1LL<<i;
		int k;
		for(k = cnt; k < n; k++) if(d[k]&b) break;
		if(k==n) continue;
		swap(d[cnt], d[k]);
		k = cnt++;
		for(int j = cnt; j < n; j++){
			if(d[j]&b) d[j] ^= d[k];
		}
	}
	cout<<(1LL<<cnt)<<endl;
	return 0;
}