#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool isprime(long n)
    {
    if(n==2)
        return 1;
    else
        {
        for(long i=2;i<=sqrt(n);++i)
            if(n%i==0)
            return 0;
            return 1;
    }
}

int main() 
{
   int g;
    long n;
    cin>>g;
    vector<long> ar;
    for(long i=2;i<=100003;++i)
        if(isprime(i))
        ar.push_back(i);
    while(g--)
        {
        cin>>n;
        long cn=0,p;
        for( p=0;ar[p]<=n;++p);
            cn=p;
            if(cn%2==0)
            cout<<"Bob\n";
            else
            cout<<"Alice\n";
    }
    
      
    return 0;
}