#!/bin/python3

import sys

def findPrimes(n):
    np1 = n + 1
    s = list(range(np1)) 
    s[1] = 0
    sqrtn = int(round(n**0.5))
    for i in range(2, sqrtn + 1): 
        if s[i]:
            s[i*i: np1: i] = [0] * len(range(i*i, np1, i))
    return filter(None, s)

def main():
    g = int(input().strip())
    for a0 in range(g):
        n = int(input().strip())
        if(n == 1):
            print("Bob")
        elif(n == 2):
            print("Alice")
            
        if(n != 1 and n != 2):
            primes = list(findPrimes(n))
            if(len(primes) % 2 == 0):
                print("Bob")
            else:
                print("Alice")
            
main()