#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;

bool IsPrime(int number)
{

    if (number == 2 || number == 3)
        return true;

    if (number % 2 == 0 || number % 3 == 0)
        return false;

    int divisor = 6;
    while (divisor * divisor - 2 * divisor + 1 <= number)
    {

        if (number % (divisor - 1) == 0)
            return false;

        if (number % (divisor + 1) == 0)
            return false;

        divisor += 6;

    }

    return true;

}
/*
int NextPrime(int a)
{

    while (!IsPrime(++a)) 
    { }
    return a;

}
*/
int main(){
    int g;
    cin >> g;
    while(g--){
        int n;
        cin >> n;
        int flag =0;
        int arr[10000+5]={};
        for(int i=0;i<n;++i){
            arr[i] = i;
        }
        for(int i=0;i<n;i++){
            while(IsPrime(arr[i])){
                flag=arr[i];
                break;
            }
        }
        if(flag==0)cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
                // your code goes here
    }
    return 0;
}