#include <stdio.h>

void merge_sort(int n, int x[])
{
	static int y[200001] = {};
	if (n <= 1) return;
	merge_sort(n / 2, &(x[0]));
	merge_sort((n + 1) / 2, &(x[n/2]));
	
	int i, p, q;
	for (i = 0, p = 0, q = n / 2; i < n; i++) {
		if (p >= n / 2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}


int solve(int N, int A[])
{
	if (N % 2 != 0) return 0;

	int i, max = 0, tmp, X;
	merge_sort(N, &(A[1]));
	for (i = 2, tmp = 1, X = A[1]; i <= N; i++) {
		if (A[i] == A[i-1]) tmp++;
		else {
			if (max < tmp) max = tmp;
			tmp = 1;
		}
		X ^= A[i];
	}
	if (max < tmp) max = tmp;
	if (max <= N / 2 || X != 0) return 0;
	else return 1;
}

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;
}