#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;
    vector<int> s(100000);
    int i=1;
    while(i < 100000){
        int j=2*(i+1)-1;
        while(j<100000){
            s[j] = 1;
            j += i+1;
        }
        i++;
    }
    
    
    for(int i=1;i<100000; i++){
        s[i] = s[i-1]+(1-s[i]);
    }
    
    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(s[n-1] % 2 == 0){
            cout<<"Bob"<<endl;
        }
        else{
            cout<<"Alice"<<endl;
        }
    }
    return 0;
}