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