#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 checkprime(int);
int checkprime(int p)
{
    if(p==2)
    {
        return 1;
    }
    if(p%2==0)
    {
        return 0;
    }
    
    for(int i=3;i<=sqrt(p);i=i+2)
    {
        if(p%i==0)
        {
            return 0;
        }
    }
    return 1;
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        vector<int> a;
        int c=0;
        for(int j=2;j<=n;j++)
        {
            if(checkprime(j)&&(find(a.begin(),a.end(),j)==a.end()))
            {
                a.push_back(j);
                for(int k=j+j;k<=n&&(find(a.begin(),a.end(),k)==a.end());k=k+j)
                {
                       a.push_back(k);
                       
                }
                if(c)
                    c=0;
                else
                    c=1;
            }
        }
        if(c)
            cout<<"Alice\n";
        else
            cout<<"Bob\n";
        
    }
    return 0;
}