#include <bits/stdc++.h>

using namespace std;
bool prime[100010];
void Sieve(int n)
{
    //bool prime[n+1];
    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;
        }
    }

    
}
int main(){
    int g;
    cin >> g;
       Sieve(100000);
    for(int i=0;i<g;i++)
          {    int nt=0;
            int n;
            cin>>n;
            if(n==1)
                  cout<<"Bob"<<endl;
             else
                   {
                    for (int p=2; p<=n; p++)
                    {if (prime[p])
                          nt++;
                    }
                    if(nt%2==0)
                        cout<<"Bob"<<endl;
                    else
                         cout<<"Alice"<<endl;
             }
    }
    return 0;
}