#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<numeric>
#include<cstring>
#include<random>
#include<array>
#include<fstream>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<queue>

/*
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/

using namespace std;

using ll = long long;
using ull = unsigned long long;

#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) std::cout << s << endl
#define PRIF(v, n) printf("%."#n"f\n", (double)v)

template<typename A, typename B>void mins(A& a, const B& b) { a = min(a, (A)b); };
template<typename A, typename B>void maxs(A& a, const B& b) { a = max(a, (A)b); };




//F2^64の部分空間を基底で管理
struct xor_space {
	std::vector<uint64_t> basis;
	bool in(uint64_t x) {
		for (uint64_t b : basis) if ((b ^ x) < x) x = b ^ x;
		return x == 0;
	}
	void add(uint64_t x) {
		for (uint64_t b : basis) if ((b ^ x) < x) x = b ^ x;
		if (x != 0) basis.push_back(x);
	}
};

int main() {
	ll N; cin >> N;
	xor_space s;
	REP(i, 0, N) {
		ll a; cin >> a;
		s.add(a);
	}
	PRI((1LL << s.basis.size()));
	return 0;
}