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

bool checkprime(int n)
    {
    if(n == 2)
        return true;
    if(n%2 == 0 || n == 1)
        return false;
    for(int i = 2; i <= sqrt(n); i++)
        {
        if(n%i == 0)
            {
            return false;
        }
    }
    return true;
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        
        
        int c = 0;
        if(n == 1)
            {
            cout << "Bob" <<endl;        
        }
        else if(n == 2)
            {
            cout << "Alice" <<endl;
        }
        else
            {
            for(int i = 1; i <= n; i++)
                {
                bool result = checkprime(i);
                if(result == true)
                    c++;
            }
            if(c%2)
                cout << "Alice" <<endl;
            else
                cout << "Bob" <<endl;
        }
        
        
    }
    return 0;
}