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

bool isPrime2(int x, vector<int> p) {
    
    for (int i = 0; i < p.size(); i++) {
        if (x % p[i] == 0) return false;
    }
    
    for (int i = p[p.size()-1]; i < sqrt(x); i+=2) {
        if (x % i == 0) return false;
    }
    
    return true;
}

int main(){
    
    vector<int> primes;
    primes.push_back(2);
    
    for (int i = 3; i <= 100000; i+=2) {
        if (isPrime2(i, primes)) {
            primes.push_back(i);
        }          
    }

    int g;
    cin >> g;

    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        
        int i = 0;
        while (i < primes.size()){
            if (primes[i] <= n)
                i++;
            else
                break;
        }
      
        if (i % 2 == 1) 
            
            cout << "Alice\n";
        else 
            cout << "Bob\n";
            
    }
    
    return 0;
}