#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n,count=0;
        cin >> n;
        for(int i=1; i<=n; i++)
    {
        /* Assume that the current number is Prime */
        int isPrime = 1;
 
        /* Check if the current number i is prime or not */
        for(int j=2; j<=i/2; j++)
        {
            /*
             * If i is divisible by any number other than 1 and self
             * then it is not prime number
             */
            if(i%j==0)
            {
                isPrime = 0;
                break;
            }
        }
 
        /* If the number is prime then print */
        if(isPrime==1)
        {
           count++;
        }
    }
        if(count%2==0)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
        // your code goes here
    }
    
    return 0;
}