#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int g;
    cin >> g;
    int counts[100001];
    bool sieve[100001];
    sieve[1]=0;
    sieve[2]=1;
    for(int i=3;i<100001;i+=2)
        sieve[i]=1;
    for(int i=3;i<sqrt(100001);i++){
        if(sieve[i]){
            int temp=2*i;
            while(temp<100001){
                sieve[temp]=0;
                temp+=i;
            }
        }
    }
    counts[1]=0;
    counts[2]=1;
    int count=1;
    for(int i=3;i<100001;i+=2)
        if(sieve[i])
            counts[i]=++count;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(n==1)
            cout<<"Bob"<<endl;
        else if(n==2)
            cout<<"Alice"<<endl;
        else{
            if((n&1)!=1)
                n--;
            while(!sieve[n])
                n--;
            if(counts[n]&1)
                cout<<"Alice"<<endl;
            else cout<<"Bob"<<endl;
        }
    }
    return 0;
}