#include <bits/stdc++.h>
#define fo(i,n) for(i=0;i<n;++i)
#define forr(i,n) for(i=n-1;i>0;--i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;

ll gcd(ll a,ll b){while(a&&b)a>b?a%=b:b%=a;return a+b;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

bool prime[100001];
ll counter[100001];

void sieve(){
    int i, j;
    prime[0] = false;
    prime[1] = false;
    prime[2] = true;
    prime[3] = true;
    for(int i = 2; i*i <= 100000 ; i++){
        if(prime[i]){
            if(i * 1ll * i <= 100000)
                for(int j = i*i ; j<=100000 ; j += i)
                    prime[j] = false;
        }
    }
}

void count(){
    counter[0] = 0;
    for(int i=0;i<100001;i++){
        counter[i] = counter[i-1];
        if(prime[i]==true){
            counter[i]++;
        }
    }
}

int main(){
    memset(prime,true,sizeof(prime));
    int n;
    int i;
    int j;
    sieve();
    count();
    int t;
    cin>>t;
    while(t--){
        cin>>n;
        if(counter[n]%2)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
    }
    return 0;
}