#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 dp[100001];
bool prime[100001];
int main(){
    
    memset(prime, true, sizeof(prime));

    for (int p=2; p*p<=100000; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=100000; i += p)
                prime[i] = false;
        }
    }

    
    memset(dp,0,sizeof(dp));
        dp[1]=0;
        dp[2]=1;
    for(int i=3;i<100001;i++){
        if(prime[i])
            dp[i]=1-dp[i-1];
        else
            dp[i]=dp[i-1];
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(dp[n]==0)
        cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
        // your code goes here
        
    }
    return 0;
}