#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int noOFprime(int n){
   int count=0;
    for (int a=2 ; a <=n; a++)
    {
        bool prime = true;
        for (int c=2 ; c*c <= a ; c++)
        {
            if(a % c == 0)
            {
                prime = false;
                break;
            }
         }
        if(prime) count++;
    }
return count;
};

int main() {
    int t;
    cin >>t;
    int n;
    for(int i=0;i<t;i++){
        int k;
        cin >>k;
        
         n = noOFprime(k);
        if(n%2==0){
            cout <<"Bob"<<"\n";
        }
        else{
            cout<<"Alice"<<"\n";
        }
       
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}