using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {
    static bool IsPrime(int a, bool[] prim, int nn) {
        int b = (int)Math.Sqrt(a);
        for(int i=2; ((i<nn) && (i<=b)); i++) {
            if (prim[i]) {
                if (a%i == 0) {
                    return false;
                }
            }
        }
        return true;
    }
    static void Main(String[] args) {
        int g = Convert.ToInt32(Console.ReadLine());
        bool[] primes = new bool[100001];
        primes[1] = false;
        primes[2] = true;
        primes[3] = true;
        primes[5] = true;
        primes[7] = true;
        int fill = 7;
        //int primeCnt = 2;
        for(int j=9; j<100001; j++) {
            if (IsPrime(j, primes, fill)) {
                primes[j] = true;
                fill = j;
            }
        }
        for(int a0 = 0; a0 < g; a0++){
            int n = Convert.ToInt32(Console.ReadLine());
            // your code goes here
            if (n == 1){
                Console.WriteLine("Bob");
            }
            else {
                //count the number of primes in the range of 2..n
                int cnt = 0; // At least 2 is available prime
                if (fill >= n) {
                    for(int i=2; i<=n; i++) {
                        if (primes[i]) {
                            cnt++;
                        }
                    }
                }
/*                else {
                    int nn = fill + 2;
                    cnt = primeCnt;
                    while(nn <= n) {
                        if (Solution.IsPrime(nn)){
                            primes[nn] = true;
                            primeCnt++;
                            cnt++;
                        }
                        nn +=2;
                    }
                }*/
                if (cnt%2 == 1) {
                    Console.WriteLine("Alice");
                }
                else {
                    Console.WriteLine("Bob");
                }
            }
        }
    }
}