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

void SieveOfEratosthenes(int n,bool *prime);

int main() {
    int g;
    cin>>g;
    for(int it=0; it<g; it++){
        int n,tot=0;
        cin>>n;
        bool *prime = new bool[n+1];
        for(int i=0; i<n+1; i++){
            prime[i] = true;
        }
        SieveOfEratosthenes(n,prime);
        for(int i=2; i<n+1; i++){
            if(prime[i]==true){
                tot++;
            }
        }
        if(tot%2==1){
            cout<<"Alice\n";
        }else{
            cout<<"Bob\n";
        }
        delete(prime);
    }
    return 0;
}

void SieveOfEratosthenes(int n,bool *prime){
    for (int p=2; p*p<=n; p++){
        if (prime[p] == true){
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    return;
}