import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353


# n=II()
# dp=[[] for _ in range(n+1)]
# for a in range(1,n+1):
#     dp[a].append([a])
#     for c in range(1,a):
#         for l in dp[a-c]:
#             nl=l+[c]
#             nl.sort()
#             if nl in dp[a]:continue
#             dp[a].append(nl)
# p2D(dp)
#
# from functools import cache
#
# @cache
# def grundy(a):
#     st=set()
#     st.add(0)
#     for l in dp[a]:
#         if len(l)==1:continue
#         c=0
#         for b in l:c^=grundy(b)
#         st.add(c)
#     # print(a,st)
#     for g in range(a+5):
#         if g not in st:return g
#     return -1
#
# for a in range(1,n+1):
#     print(a,grundy(a))

def grundy(a):
    if a<6:return [0,1,1,2,2,4][a]
    g=a//3*4-4+a%3*2
    return g

for _ in range(II()):
    II()
    aa=LI()
    g=0
    for a in aa:g^=grundy(a)
    print("Alice" if g else "Bob")