#include <iostream>
#include<bits/stdc++.h>
typedef unsigned long long ull;

ull prime[100010];

void sieve(ull n)
{
    for(ull i=0;i<=n;i++)
        prime[i]=1;
    for(ull j=2;j<=n;j++)
    {
        if(prime[j]==0)
            continue;

            for(ull k=2*j;k<=n;k+=j)
                prime[k]=0;
    }
}
using namespace std;

int main()
{
    ull g;
    cin>>g;
    while(g--)
    {
        ull n;
        cin>>n;
        sieve(n);
        ull ctr=0;
        for(ull i=2;i<=n;i++)
        {
            if(prime[i])
            ctr++;
        }

            if(ctr%2==0)
                cout<<"Bob\n";
            else cout<<"Alice\n";



    }
    return 0;
}