#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;
    vector<int> n;
    int max = 0;
    for(int a0 = 0; a0 < g; a0++){
        int num;
        cin >> num;
        n.push_back(num);
        if(num > max){
            max = num;
        }
        // your code goes here
    }
    //cout<<max;
    int prime[max];
    prime[0]=2;
    prime[1]=3;
    int count=2;    
    int nq=1;
    while(6*nq-1<=max){
        int flag1=0;
        int flag2=0;
        for(int i=0;prime[i]<=(int)sqrt(6*nq+1);i++){
            if((6*nq-1)%prime[i]==0){
                flag1=1;
            }
            if((6*nq+1)%prime[i]==0){
                flag2=1;
            }
        }
        if(flag1==0){
            prime[count++]=6*nq-1;
            if(6*nq-1>=max){
                break;
            }
        }
        if(flag2==0){
            prime[count++]=6*nq+1;            
        }
        nq++;
    }
    /*for(int i=0;i<count;i++){
        cout<<prime[i]<<" ";
    }*/
    for(int i=0;i<g;i++){
        //cout<<i<<" ";
        if(n[i]==1){
            cout<<"Bob\n";
        }
        else if(n[i]==max || n[i]>=prime[count-1]){
            if(count%2 == 0){
                cout<<"Bob\n";
            }
            else{
                cout<<"Alice\n";
            }
        }
        else{
            for(int j=1;j<count;j++){
                if(prime[j]>n[i]){
                    if(j%2 == 0){
                        cout<<"Bob\n";
                        break;
                    }
                    else{
                        cout<<"Alice\n";
                        break;
                    }
                }
            }
        }
    }
    return 0;
}