#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 is_prime(vector<int> & primes, int num)
{
    int size=primes.size();
    
    for(int i=0; i<size; i++) {
        if(num % primes[i] == 0) return false;
    }
    
    return true;
}

int primes(int n) {
    if(n == 1) return 0;
    if(n == 2) return 1;
    
    vector<int> num;
    num.push_back(2);
    
    for(int i=3; i<=n; i=i+2)
    {
        if(is_prime(num, i)) num.push_back(i);
    }
    
    return num.size();
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        
        if(primes(n) & 1 == 1) cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }
    return 0;
}