// yukicoder: No.184 たのしい排他的論理和(HARD)
// 2019.4.13 bal4u

#include <stdio.h>

//// 高速入力
#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
long long in()    // 非負整数の入力
{
	long long n = 0;
	int c = gc();
	do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

long long A[100005];

int main()
{
	int i, j, N;
	long long a, ans;

	N = (int)in();
	for (i = 0; i < N; i++) A[i] = in();
	ans = 0; for (i = 0; i < N; i++) if (A[i]) {
		ans++, a = A[i] & (-A[i]);
		for (j = i + 1; j < N; j++) if (A[j] & a) A[j] ^= A[i];
	}
	printf("%lld\n", 1LL << ans);
	return 0;
}