// Time complexity: O(N log log N)

#include<bits/stdc++.h>
using namespace std;
#define MAX 100002
bool prime[MAX];
int p[MAX];

void init_prime()
{
    prime[2] = true;
    for (int i = 3; i < MAX; i += 2) prime[i] = true;

    for (int i = 3; i*i < MAX; i += 2)
    {
        if(prime[i])
        {
            for (int j = i*i; j < MAX; j += i+i)
            prime[j] = false;
        }
    }
}
int main()
{
    int cont=0,n,a;
    init_prime();
    for(int i=1;i<MAX;i++)
    {
        if (prime[i])
        {
            cont++;
        }
        p[i]=cont;
    }
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a);
        if(p[a]%2==0)
        {
            printf("Bob\n");
        }
        else printf("Alice\n");
    }
}