#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 win[1000],k=1,i=0,sum=2 ;//0 for bob , 1 for alice
    while(i<=100)
    {
        int count=0;
        for(;i<sum;i++)
        { 
            if(count<pow(2,k)/2)
            {
                win[i]=0;
                count++;
            }
            else
            win[i]=1;
        }
        k++;
        sum+=pow(2,k);
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(win[n-1]==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
   
    return 0;
}