#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,a,i,j,c,k=0,n;;
    cin >> g;
    for(a = 0; a< g; a++){
        int n;
        cin >> n;
        k=0;
        // your code goes here
        for(i=1; i<=n; i++)
            {
            c=0;
            for(j=2; j<=(i/2); j++)
                {
                if(i%j==0)
                    c++;
            }
            if(c==0)
                k++;
        }
        if(k%2!=0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}