#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 prime(int n)
{
    if(n<2||(!(n&1)&&n!=2))
        return 0;
    for(int i=3;i*i<=n;i++)
        if(!(n%i))
        return 0;
        return 1;
}


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        vector<int>c(n);int pcount=0;
        for(int i=0;i<n;i++)
        {
            if(prime(i+1))   
                pcount++;
        }
        if(pcount%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
        
        // your code goes here
    }
    return 0;
}