#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;
        long arr[n+1],i,j;
        for(i=0;i<=n;i++)
            arr[i]=0;
 
    for (i = 2; i < n+1; i++)
    {
        for (j = i * i; j < n+1; j+=i)
        {
            arr[j] = 1;
        }
    }
        //arr[1]=1;
        int c=0;
        for(i=2;i<=n;i++){
            if(arr[i]==0)
                c++;
        }
       // cout<<c;
        
        if(c%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";

        // your code goes here
    }
    return 0;
}