#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;
#define N 100001


void preprocess(vector<bool> &P, vector<int> &A){
    P[0] = false;
    P[1] = false;
    int m = (int) sqrt(N);
    for (int i=2; i<=m; i++){
      if (P[i]){
         for (int k=i*i; k<N; k+=i)
            P[k]=false;
      }
    }
    A[0] = 0;
    A[1] = 0;
    for(int i = 2; i<N; i++){
        if(P[i])
            A[i] = A[i-1] + 1;
        else
            A[i] = A[i-1];
    }
}
    
int main(){
    int g;
    cin >> g;
    vector<bool> P(N, true);
    vector<int> A(N, 0);
    preprocess(P, A);
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(A[n]&1)  cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
    }
    return 0;
}