import math


def prime(n):
    i=1
    c=0
    while i<=int(math.sqrt(n)):
        if n%i==0:
            c+=1
        if c>1:
            return 0
        i+=1
    if c==1:
        return 1

g=int(input())
i=0
while i<g:
    n=int(input())
    if n==1:
        print('Bob')
    else:
        li=[int(x)for x in range(2,n+1)]
        print(li)
        c=0
        while True:
            for x in li:
                flag=0
                if prime(x):
                    flag=0
                    j=0
                    c1=0
                    while j<len(li):
                        if li[j]%x==0:
                            c1+=1
                            li.remove(li[j])
                        else:
                            j+=1
                    print(c1)
                    if c1<1 and c%2==0:
                        print ('Alice')
                    elif c1<1 and c%2==1:
                        print ('Bob')
                    break
                else:
                    flag=1
            if flag==1 and c%2==0:
                print('Alice')
            elif flag==1 and c%2==1:
                print('Bob')
            c+=1
            print(c)
            if len(li)==0 and c%2==0:
                print('Alice')
            elif len(li)==0 and c%2==1:
                print('Bob')
    i+=1