import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int g = cin.nextInt();
        int t,cp=0;
        for( t = 0; t< g; t++)
        {
            cp=0;
            int n=cin.nextInt();
            boolean[] isprime = new boolean[n+1];
            for (int i = 2; i <= n; i++) 
                isprime[i] = true;
            for (int factor = 2; factor*factor <= n; factor++) 
            {
                if (isprime[factor]) 
                {
                    for (int j = factor; factor*j <= n; j++) 
                        isprime[factor*j] = false;
                }
            }
            for (int i = 2; i <= n; i++) 
                if (isprime[i]) cp++;
            /*if( m<=n && m!=1 )
                i=m+1;
            else
            {
                cp=0;
                i=2;
            } 
            m=n;
            for(;i<=n;i++)
            {
                c=0;
                for(j=2;j<=i/Math.sqrt(2);j++)
                    if(i%j==0)
                    {
                        c=1;
                        break;
                    }
                if(c==0)
                    cp++;
            }*/
            if(cp%2!=0)
                System.out.println("Alice");
            else
                System.out.println("Bob");
        }
    }
}