#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>
#define ll long int
using namespace std;


int main(){
    //sieve's
    bool notPrime[100001] = {false};
    for(ll i = 2; i <= 100000; i++){
        if(!notPrime[i]){
            for(ll j = 2*i; j <= 100000; j += i){
                notPrime[j] = true;
            }
        }
    }
    int g;
    cin >> g;
    while(g--){
        ll n, cnt = 0;
        cin >> n;
        for(ll i = 2; i <= n; i++){
            if(!notPrime[i]){
                cnt++;
            }
        }
        if(cnt%2 == 0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
    return 0;
}