#include int solve(int N, int A[]) { if (N % 2 != 0) return 0; int i, X = 0; for (i = 1; i <= N; i++) X ^= A[i]; if (X == 0) return 1; else return 0; } int main() { int i, t, T, N, A[200001]; scanf("%d", &T); for (t = 1; t <= T; t++) { scanf("%d", &N); for (i = 1; i <= N; i++) scanf("%d", &(A[i])); if (solve(N, A) == 0) printf("Alice\n"); else printf("Bob\n"); } fflush(stdout); return 0; }