import bisect

def solve():
    t = int(input())

    make = [2**i for i in range(60)]
    for i in range(1, 55):
        make[i] += make[i-1]
    
    for _ in range(t):
        n = int(input())
        if n == 2:
            print("Bob")
            continue

        idx = bisect.bisect_left(make, n)
        if idx<len(make) and make[idx] == n:
            print("Bob")
        else:
            print("Alice")

if __name__ == "__main__":
    solve()