#include<bits/stdc++.h>
using namespace std;

int prime[300000], nPrime;
int mark[1000002];

void sieve(int n)
{
    int i, j, limit = sqrt(n*1.) + 2;

    mark[1] = 1;
    for(i = 4; i <= n; i += 2) mark[i] = 1;

    prime[nPrime++] = 2;
    for(i = 3; i <= n; i += 2)
    {
        if(!mark[i])
        {
            prime[nPrime++] = i;

            if(i <= limit)
            {
                for(j = i * i; j <= n; j += i * 2)
                {
                    mark[j] = 1;
                }
            }
        }
    }
}

int main()
{
   int q;
   cin>>q;

   int n;
   for(int i = 0; i < q; i++)
   {
     cin>>n;
     nPrime = 0;

     sieve(n);

     if(n > 1 && nPrime % 2 == 1) cout<<"Alice"<<endl;
     else cout<<"Bob"<<endl;
   }
   return 0;
}