#include<bits/stdc++.h>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pb push_back

using namespace std;

inline ll read()
{
	ll f=1,sum=0;char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-1;c=getchar();}
	while (isdigit(c)) {sum=sum*10+c-'0';c=getchar();}
	return sum*f;
}
const int MAXN=100010;
unordered_set <int> s;
int a[MAXN];
int main()
{
	int n=read();
	for (int i=1;i<=n;i++)
	{
		a[i]=read();
		unordered_set <int> :: iterator it;
		vector <int> need;
		for (it=s.begin();it!=s.end();)
		{
			if (a[i]&*it==*it) a[i]^=(*it),it++;
			else{
				int d=a[i]&*it;
				int d2=*it-d;
				a[i]-=d;
				auto nit=it;
				it++;
				s.erase(nit);
				if (d) need.push_back(d);
				if (d2) need.push_back(d2);
			}
		}
		if (a[i]) need.push_back(a[i]);
		for (auto v:need) s.insert(v);
	}
	int num=s.size();
	cout<<(1ll<<num)<<endl;
	return 0;
}