#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;
        int arr[n] = {0};

    if(n != 1 && n != 2 && n != 3){
            for (int i = 2; i < n; i++)
    {
        for (int j = i * i; j <= n; j+=i)
        {
            arr[j - 1] = 1;
        }
    }
    int c = 0;
    for (int i = 0; i < n; i++)
    {
        if (arr[i] == 0)
            c++;
    }
    if(c%2 == 0){
        cout << "Alice\n";
    }else{
        cout << "Bob\n";
    }
    }else if (n == 1){
        cout << "Bob\n";
    }else if (n == 2){
        cout << "Alice\n";
    }else if (n == 3){
        cout << "Bob\n";
    }
    }
    return 0;
}