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

bool isPrime(int number){

    if(number < 2) return false;
    if(number == 2) return true;
    if(number % 2 == 0) return false;
    for(int i=3; (i*i)<=number; i+=2){
        if(number % i == 0 ) return false;
    }
    return true;

}
int main() {
    int t,i,j,n;
    cin>>t;
    for(i=0;i<t;i++){
        int count=0;
        cin>>n;
        if(n==1){
            cout<<"Bob"<<endl;
            continue;
        }
        if(n==2){
            cout<<"Alice"<<endl;
            continue;
        }
        for(j=2;j<=n;j++){
                if(isPrime(j)==true)
                    count++;
            }
            if(count%2==0)
                cout<<"Bob"<<endl;
            else
                cout<<"Alice"<<endl;
        
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}