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

vector<bool> prime(100001,1);

int main() {
    prime[0]=0;prime[1]=0;
     for (int p=2; p*p<=100000; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=100000; i += p)
                prime[i] = false;
        }
    }
    int g;
    cin>>g;
    while(g--){
        int n;
        cin>>n;
        int count=0;
        for(int i=0;i<=n;i++){
            if(prime[i])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;
}