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


int main() {
    int t;
    cin>>t;
    while(t--)
    {
        int c=0;
        int n;
        cin>>n;
        bool prime[n+1];
        for(int i=0;i<n+1;i++)
            prime[i]=true;
        //memset(prime, true, sizeof(prime));
        for (int p=2; p*p<=n; p++)
        {
            if (prime[p] == true)
            {
                for (int i=p*2; i<=n; i += p)
                    prime[i] = false;
            }
        }
        for (int p=2; p<=n; p++)
           if (prime[p])
              c++;
        if(c%2==1)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
    }
    return 0;
}