#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

bool is_prime(int x)
{
    int count=0;
    for(int i=1;i<=x;i++)
        if(x%i==0)
        count++;
    if(count==2)
        return true;
       else
        return false;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int g,n,count =0;
    cin>>g;
    for(int i=0;i<g;i++)
    {
        cin>>n;
        for(int j=1;j<=n;j++)
        {
            if(is_prime(j))
                count++;
        }
        if(count%2==1)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
        count=0;
    }
    
    return 0;
}