#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;
        if(n ==1){
            cout << "Bob" << endl;
            continue;
        }
        bool x[n+1];
        for(int i=0;i<=n;i++){
            if(i%2 == 0) x[i] = true;
            else x[i] = false;
        }
        int ans = 1;
        for(int i=3; i<=n;i++){
            if(!x[i]){
                int k = 1;
                ans++;
                while(i*k <= n){
                    x[i*k] = true;
                    k++;
                }
            }
        }
        if(ans %2 == 0) cout << "Bob" << endl;
        else cout << "Alice" << endl;
    }
    return 0;
}