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