#include <iostream>
#include <math.h>
#include <algorithm>
#include <unordered_map>

using namespace std;


int Prime(int x){
    if (x==2 or x==3 or x==5)
        return 1;
    if(x==1 or x%2==0 or x%5==0 or x%3==0)
        return 0;
    int i=5;
    while (i<=pow(x,0.5))
            {
        if( x%i==0 or x%(i+2)==0)
            return 0;
        i+=6;
        }
    return 1;
}



int main(){
    int t,n,p;
    cin>>t;
    while(t--)
        {
         int n,count=0;
        while(1)
            {
        cin >> p;
        if(p>0)
            {
            n=p;
            break;
        }
        }
    
    for(int i=1;i<=n;i++)
        {
            if(Prime(i)==1)
                {
                    count++;
                } 
        }
        if(count%2==1)
            {
            cout<<"Alice"<<endl;
        }
        else
            {
            cout<<"Bob"<<endl;
        }
    }
    return 0;
}