#include <iostream>
#include <cassert>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <time.h>
#define ll long long
#define MAXN 100000
#define MODD 1000000007
using namespace std;


bool isprime[111111];
int numprimes[111111];
int main() {
    
    for(int i=2;i<=MAXN;i++) {
        isprime[i]=true;
    }
    
    for(int i=2;i<=MAXN;i++) {
        for(int j=2;j<=MAXN/i;j++)
            isprime[i*j]=false;
    }
    
    
    numprimes[1]=0;
    for(int i=2;i<=MAXN;i++) {
        numprimes[i]=numprimes[i-1];
        if (isprime[i])
            numprimes[i]++;
    }
    
    
    int T;
    cin>>T;
    for(int t=1;t<=T;t++) {
        int n;
        cin>>n;
        
        
        int counts = numprimes[n];
        
        if (counts%2==1) {
            cout << "Alice" << endl;
        } else {
            cout << "Bob" << endl;
        }
        
        
        
    }
}