#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <string>
#include <assert.h>
#include <iostream>
#include <cstdlib>
#include <fstream>
#include <algorithm>
#include <functional>
#include <memory.h>
#define pb push_back
#define fst first
#define scn second
#define mp make_pair
#define lint long long
#define sc(x) scanf("%d", &x)
#define rep(i,a,b) for(lint i=a; i<b; i++)
#define mn(a,b,c,d) min(a,min(b,min(c,d)))
#define maxn 100005
using namespace std;
bool B[maxn];
int A[maxn];
void seive(){
    rep(i,0,maxn)B[i]=1;
    B[0]=B[1]=0;
    rep(i,2,maxn){
        if(!B[i])continue;
        int j=i;
        while(j+i<maxn){
            B[j+i]=0;
            j+=i;
        }
    }
    A[2]=1;
    rep(i,3,maxn){
        A[i]=A[i-1];
        if(B[i])A[i]++;
    }
}
int main(){
    seive();
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        
        if(A[n]%2)cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }
}