import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
sys.setrecursionlimit(10**7)
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
t = ni()
from collections import deque,Counter

for _ in range(t):
    n = ni()
    a = na()
    if n%2:
        print("Alice")
        continue
    c = Counter([i for i in a])
    p = sum([1 for i in c if c[i]==1])
    q = sum([c[i]-1 for i in c if c[i]>=2])
    r = len([c[i]-1 for i in c if c[i]>=2])
    z = max(n//2-1-p-r,0)
    if q-z<=n//2-1:
        print("Alice")
    else:
        print("Bob")