#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 pri[100001];
    for(long long i=0;i<100001;i++)
        pri[i]=1;
    pri[0]=0;
    pri[1]=0;
    for(long long i=2;i<sqrt(100001);i++)
        for(long long j=i*i;j<=100001;j=j+i)
        pri[j]=0;
    for(int a0 = 0; a0 < g; a0++){
        long long n;
        cin >> n;
        long long count=0;
        for(long long i=1;i<=n;i++)
            if(pri[i]==1)
            count++;
            if(count%2==1)
            cout<<"Alice"<<endl;
            else
            cout<<"Bob"<<endl;
        // your code goes here
    }
    return 0;
}