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

/*bool is_prime(int n){
    if(n<=1)return false;
    if(n==2)return true;
    for(int i=2;i<=sqrt(n);i++){
        if(n%i==0)return false;
    }
    return true;
}

vector<int> find_primes(vector<int> n){
    vector<int> res;
    for(unsigned i=0;i<n.size();i++){
        if(is_prime(n[i]))res.push_back(n[i]);
    }
    return res;
}*/

vector<int> sieve_of_eratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries as true initially. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    vector<bool>prime(n+1,true);
    //memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*p; i<=n; i += p)
                prime[i] = false;
        }
    }
    
    vector<int>res;
    
    for (int p=2; p<=n; p++)
       if (prime[p]) res.push_back(p);
        
    return res;
}

int main() {
    int g; cin>>g;
    for(int i=0;i<g;i++){
        int n; cin>>n;
        vector<int>primes = sieve_of_eratosthenes(n);
        if(primes.size()%2==0)cout<<"Bob"<<endl;
        else cout<<"Alice"<<endl;
    }
    
    return 0;
}