#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 n)
    {
    if(n == 2)
        return true;
    for(int i=2;i<=pow(n,0.5);i++)
        {
        if(n%i == 0)
            return false;
    }
     return true;  
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int a[n];
        int m = n;
        if(m == 1)
            cout<< "Bob" <<endl;
        else
           {
            int s = 0;
            for(int i=2;i<=n;i++)
                if(isprime(i))
                s++;
            if(s%2 == 0)
                cout<< "Bob" << endl;
            else
                cout<< "Alice" << endl;
        } 
    }
    return 0;
}