#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<string>
#include<map>
#include<list>
#include<queue>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<math.h>
#include<set>
#include<stack>
#include<fstream>
#include<numeric>
#include<string>
#include<vector>
#include<iterator>
using namespace std;
struct node{
    int x;
    long long wei;
   // node(){}
   // node(int x,int y):x(x),y(y){}
    bool operator < (const node & p) const
    {
        return wei>=p.wei;
    }
};
struct edge{
    int x;
    long long wei;
   // node(){}
   // node(int x,int y):x(x),y(y){}
    bool operator < (const edge & p) const
    {
        return wei<p.wei;
    }
};
int vis[1200000];
vector<int>vc;
void prime()
{
    vc.push_back(2);
    for(int i=3;i<=100000;i+=2){
        if(vis[i]==0){
            vc.push_back(i);
            for(int j=3;j*i<=100000;j+=2){
                vis[i*j]=1;
            }
        }
    }


}
int main()
{
   prime();
   int i,j,k,l,m,n;
  // for(i=0;i<100;i++)cout<<vc[i]<<" ";
   scanf("%d",&m);

while(m--){
    scanf("%d",&n);
    int ans=-1;
    int mid;
    l=0,k=vc.size()-1;
    while(l<=k){
        mid=(l+k)/2;
        if(vc[mid]<=n){
            ans=mid;
            l=mid+1;
        }
        else k=mid-1;

    }
    ans++;
    if(ans%2)printf("Alice\n");
    else printf("Bob\n");


}
}