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

void SieveOfEratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    for(int i=0;i<=n;i++){
        prime[i]=1;
    }
 
    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*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    // Print all prime numbers
    int x=0;
    for (int p=2; p<=n; p++)
       if (prime[p])x++;
        
    if(x%2==0)cout<<"Bob"<<"\n";
    else cout<<"Alice"<<"\n";
}

int main() {
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
    SieveOfEratosthenes(n);
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}