#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

void getPrimes(vector<int> & res){
    int n=100000;    
    res.push_back(2);
    res.push_back(3);
    res.push_back(5);
    res.push_back(7);
    res.push_back(11);
    for (int i=13;i<n;i+=2){
        int sq = int (sqrt(i));
        int count=0;
        int ans=1;
        while (res[count]<sq+1){
            if (i%res[count]==0){
                ans=0;
                break;
            }
            count++;
        }
        if (ans==1){
            res.push_back(i);
            
        }
    }
    
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    vector<int> primes;
    getPrimes(primes);
    vector<int>res;
    int count=0;
    res.push_back(0);
    res.push_back(0);    
    for (int i=0;i+1<primes.size();++i){
        count++;
        for (int j=primes[i];j<primes[i+1];++j){
            res.push_back(count);
        }        
    }
    int t;
    cin  >> t;
    for (int i=0; i<t ;++i){
        int N;
        cin >> N;
        if (res[N]%2==1){
            cout << "Alice" << endl;
        } else {
            cout << "Bob" << endl;
        }
    }
    return 0;
}