#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 prime[100005], A[100005];

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