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


int main() {
    
    long int n=100001,sum=0,num=0,max;
    vector<bool>prime(n+1,true);
    prime[0]=false;
    prime[1]=false;
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            //sum++;
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    
    int test;cin>>test;
    while(test--){
        sum=0;
        int n1;
        cin>>n1;
        for(int i=0;i<=n1;i++)
            if(prime[i]==true) sum++;
    if(sum%2==0) cout<<"Bob\n";
    else cout<<"Alice\n";
    
    }
    return 0;
}