#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;
 
// Driver Program to test above function
 

int main(){
    
    bool prime[100001];
    memset(prime, true, sizeof(prime));
    int n = 100001;
    for (int p=2; p*p<=n; 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<=n; i += p)
                prime[i] = false;
        }
    }
    
    int sum_total[100001] ;
    sum_total[0] = prime[0];
    for (int i = 1; i< 100001; i++){
        sum_total[i] = sum_total[i-1]+prime[i];
    }
     
    
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if (sum_total[n] %2 == 1) {cout << "Alice\n";}
        else {cout << "Bob\n";}
        
    } 
    
    
    return 0;
     
}