#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;
bool prime[100001]={0};
void init()
{
    prime[0]=1;
    prime[1]=1;
    prime[2]=0;
    int i,j;
    for(i=1;i<=100000;i++)
    {
        if(!prime[i])
        {
            for(j=2;i*j<=100000;j++)
            {
                if(i*j<=100000)
                    prime[i*j]=1;
            }
        }
    }
}
int main()
{
    int g;
    cin>>g;
    init();
    for(int a0=0;a0<g;a0++)
    {
        int n;
        cin>>n;
        int count=0;
        for(int k=1;k<=n;k++)
        {
            if(prime[k]==0)
                count++;
        }
        if(count%2==0)
            cout<<"Bob\n";
        else 
            cout<<"Alice\n";
    
    }
    return 0;
}