#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 a = 0; a < g; a++){
        long int n,i,c=0,t,j,c1=0;
        cin >> n;
        if(n==1)
            cout<<"Bob";
        else if(n==2)
            cout<<"Alice";
        else
            {
             for(t=1;t<=n;t++)
                 {
                 for(j=2;j<=n/2;j++)
                     {
                     if(n%j==0)
                         {
                         c++;
                     }
                     else
                         c1++;
                 }               
             }
            if(c1>c)
                cout<<"Alice";
            else
                cout<<"Bob";
    }
        cout<<endl;
    }
        
    return 0;
}