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

void alicAndBob(int a);
using namespace std;

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
alicAndBob(n);
    }
    return 0;
}

void alicAndBob(int a){
    int count =0,i= 2 ;
    while (i<=a) {
        if (a%i == 0) {
            count++;
        }
        i++;
    }
    
    if(a == 0  || a== 1){
        cout << "Bob";
        cout << "\n";
        return;
    }
    
    if (count%2 == 0){
        cout << "Bob";
    }else{
        cout << "Alice";
    }
    cout << "\n";
}