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

string findWinner(string a){
    if(a == "Alice")
        return "Bob";
    else
        return "Alice";
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        string s = "Alice";
        if(n == 1){
            cout << findWinner(s) << endl;
            continue;
        }
        
        vector<int> A(n+1, 1);
        A[0] = -1;
        A[1] = -1;
        for(int i=2; i<=n; i++){
            if(A[i] == 1){
                //cout << i << endl;
                for(int j=2; i*j<=n; j++){
                    A[i*j] = -1;
                }
                s = findWinner(s);
            }
        }
        // your code goes here
        cout << findWinner(s) << endl;
    }
    return 0;
}