#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;

void RemovePrime(vector<long int>& a, int prime)
{
    for(int i=0; i<a.size(); i++)
    {
        if(a[i]%prime == 0)
        {
            a.erase(a.begin()+i);
            i--;
        }
    }
}

int main(){
    int turns = 0;
    int g;
    cin >> g;
    
    vector<long int> a;
    for(int a0 = 0; a0 < g; a0++)
    {
        int n;
        cin >> n;
        
        for(int i=2; i<=n; i++)
            a.push_back(i);
        
        while(!a.empty())
        {
            RemovePrime(a, a[0]);
            turns++;
        }
    
        if(turns%2==0)
        {
            cout << "Bob" << endl;
        }
        else
            cout << "Alice" << endl;
        
        turns = 0;
    }
    
    return 0;
}