#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;
        int num =  floor(n / log(n));
        if ( n == 1)
            cout << "Bob";
        else
            if ( num % 2 )
                cout << "Bob" ;
            else
                cout << "Alice";
        cout << "\n";
        // your code goes here
    }
    return 0;
}