// yukicoder: No.183 たのしい排他的論理和(EASY) // 2019.4.13 bal4u #include //// 高速入力 #if 1 #define gc() getchar_unlocked() #define pc(c) putchar_unlocked(c) #else #define gc() getchar() #define pc(c) putchar(c) #endif int in() // 非負整数の入力 { int n = 0, c = gc(); // while (isspace(c)) c = gc(); do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0'); return n; } int A[5005]; int main() { int i, j, N, a, ans; N = 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("%d\n", 1 << ans); return 0; }