#!/bin/python3

import sys
def primes(n):
    """ Returns  a list of primes < n """
    sieve = [True] * n
    for i in range(3,int(n**0.5)+1,2):
        if sieve[i]:
            sieve[i*i::2*i]=[False]*((n-i*i-1)/(2*i)+1)
    return [2] + [i for i in range(3,n,2) if sieve[i]]

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    # your code goes here
    if n==1:
        print("Bob")
        continue
    l=primes(n)
    ll=len(l)
    d=ll%2
    if d==2:
        print("Bob")
    else:
        print("Alice")