#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 d[100002],f[100002];

int main(){
    int g;
    cin >> g;
    for(int i=2;i<=100000;i++){
        if(!d[i])
           for(int a=2*i;a<=100000;a+=i)d[a]=1;
    }
    for(int a=2;a<=100000;a++){
        if(!d[a]) f[a]=1;
        f[a]+=f[a-1];
    }
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(f[n]%2==0) cout<<"Bob"; else cout<<"Alice";
        cout<<endl;
    }
    return 0;
}