#include<bits/stdc++.h>

using namespace std;
#define ll long long
//
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define mod 1000000007
#define mp make_pair
//#define pi acos(-1.0)
//#define V 202
#define rep(i,a,b) for(int i=a;i<=b;i++)
//#define maxn 100005
//#define MAX_NUMBER_OF_NODES 100005
//#define MAX_ASCII_CODE 26


int Set(int N,int p){return N | (1<<p);}
int reset(int N,int p){return  N & ~(1<<p);}
bool check(int N,int p){return (bool)(N & (1<<p));}

bool is_prime(int a)
{
    if(a==1)return 0;
    if(a==2)return 1;
    if(a%2==0)return 0;

    int sq = sqrt(a);

    for(int i=3;i<=sq;i+=2)
    {
        if(a%i==0)return 0;
    }

    return 1;
}

int ans[100001];

int main()
{
    int g;
    cin>>g;
    rep(i,1,100000)
    {
        if(is_prime(i))ans[i] = 1+ans[i-1];
        else ans[i] = ans[i-1];
    }
    while(g--)
    {
        int n;
        cin>>n;
        if(ans[n]%2==0)cout<<"Bob\n";
        else cout<<"Alice\n";
    }
}