#include<iostream> 
#include<cstdio> 
#include<cstring> 
using namespace std; 
int prime[100001],tot,q,s,N; 
bool mark[100001];
int pre[100010]; 
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int main()
{  
    q=read(),N=100000;
    for(int i=2;i<=N;i++)
	{ 
        if(!mark[i]){ 
            prime[++tot]=i; 
        } 
        for(int j=1;j<=tot;j++){ 
            if(prime[j]*i>N) break; 
            mark[prime[j]*i]=1; 
            if(i%prime[j]==0) break; 
        } 
    }
    for (int i=2;i<=N;i++)
    	pre[i]=pre[i-1]+!mark[i];
    int n;
    while (q--)
    {
		n=read();
		if (pre[n]&1) printf("Alice\n"); else printf("Bob\n");
	}
}