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