#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;

vector<int> Pi(100010);
int maxPi = 0;

bool prime(int n)
{    
    if (n == 2 || n == 3)
        return true; 
    if ((n & 1) == 0)
        return false;    
    int j = 3;
    
    while (j*j <= n)
    {
        if (n % j == 0)
            return false;
        j += 2;
    }
    return true;  
    
}

int pi(int n)
{
    if (n <= maxPi)
        return Pi[n];


    int q = Pi[maxPi];
    for (int j = maxPi+1; j <= n; j ++)
    {
        if (prime(j))
            q++;
        Pi[j] = q;
    }   
    
    maxPi = n;
    
    return Pi[n];
}



int main(){
    int g;
    cin >> g;
    Pi[1] = 0;
    Pi[2] = 1;
    maxPi = 2;
    

    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;

        
        // your code goes here
        int m = pi(n);
        
        if (m & 1) // odd
            cout << "Alice" << endl;
        else
            cout << "Bob" << endl;
    }
    return 0;
}