//#define WYTE 133
#include<bits/stdc++.h>
#define X first
#define Y second
#define mp(x,y) make_pair((x),(y))
#define pb(x) push_back(x)
#define eb emplace_back
#define ALL(x) (x).begin(),(x).end()
#define INIT(x,y) memset((x),(y),sizeof(x))
#define arrayin(a,n) for(int i=0;i<n;i++){cin>>a[i];}
#define arrayin1(a,n) for(int i=1;i<=n;i++){cin>>a[i];}
#define arrayout(a,n) for(int i=0;i<n;i++){cout<<a[i]<<" \n"[i+1==n];}
#define arrayout1(a,n) for(int i=1;i<=n;i++){cout<<a[i]<<" \n"[i+1>n];}
#define PQ priority_queue
#define IT iterator
#define INF 1e9
#define LLNF 1e18
#define EPS 1e-9
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int g,n,i,j,is_prime[100005];
    for(i=2;i<=100000;i++)
    {
        is_prime[i]=1;
    }
    for(i=2;i<=100000;i++)
    {
        if(is_prime[i])
        {
            for(j=i+i;j<=100000;j+=i)
            {
                is_prime[j]=0;
            }
        }
    }
    is_prime[1]=0;
    for(i=2;i<=100000;i++)
    {
        is_prime[i]+=is_prime[i-1];
    }
    cin>>g;
    while(g--)
    {
        cin>>n;
        cout<<(is_prime[n]%2?"Alice\n":"Bob\n");
    }
}