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

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            int primes = 0;
            boolean[] sieve = new boolean[n+1];
            sieve[0] = sieve[1] = true;
            int p = 2;
            while(p <= n){
                if(sieve[p] == false){
                    primes++;
                    for(int x = p; x <= n; x+=p){
                        sieve[x] = true;
                    }
                }
                p++;
            }
            System.out.println(primes%2 == 0?"Bob":"Alice");
        }
    }
}