#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;
        // your code goes here
        bool* tab = new bool[n + 1];
        for (int i = 0; i <= n; ++i) tab[i] = 0;
        int i = 2;
        string winner = "Bob";
        while (i <= n){
            int j = i;
            if (tab[i]) {i++; continue;}
            while (j <= n){
                tab[j] = 1;
                j += i;
            }
            i++;
            if (winner == "Alice"){
                winner = "Bob";
            }
            else{
                winner = "Alice";
            }
        }
        
        cout<<winner<<endl;
        
        delete [] tab;
       
    }
    return 0;
}