#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 isp[100005];

int main(){
    
    isp[0] = isp[1] = 1;
    for(int i = 2;i<100005;i++){
        if(isp[i] == 0)
            for(int j = i+i;j<100005;j+=i)
            isp[j] = 1;
    }
    for(int i = 0;i<100005;i++){
        isp[i] = isp[i]^1;
    }
    for(int i = 1;i<100005;i++){
        isp[i] += isp[i-1];
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(isp[n]%2 == 0)
            cout<<"Bob";
        else
            cout<<"Alice";
        cout<<endl;
    }
    return 0;
}