#include <bits/stdc++.h>
using namespace std;
 
void SieveOfEratosthenes(int n){

    bool prime[n+1];
    int count = 0;
    memset(prime, true, sizeof(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;
            }
    }

    for (int p=2; p<=n; p++)
       if (prime[p])
          count++;
    if(count%2 == 0) cout << "Bob" << endl;
    else cout << "Alice" << endl;
}
 
int main()
{
    long int n,t;
    cin >> t;
    while(t--){
        cin >> n;
        SieveOfEratosthenes(n);
    }
    return 0;
}