#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<cstring>
using namespace std;
void sieve(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]=true;
    }
int count=0;
    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
    for (int p=2; p<=n; p++)
        {
       if (prime[p])
          count++;
    }
        if(count&1)
        {
        cout<<"Alice"<<endl;
    }
    else
        {
        cout<<"Bob"<<endl;
    }
}
int main() {
   int t,n;
    cin>>t;
    while(t--)
        {
       cin>>n;
        sieve(n);    
    }
    return 0;
}