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


int main(){
    int g, n, prime[100001], i, j, count;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        cin >> n;  
        
        for(i=2; i<=n; i++) {
            prime[i] = 1;
        }
       
        prime[0]=0; prime[1]=0;
        
        for(i=2; (i*i)<=n; i++) {
            if(prime[i]) {
                for(j=(2*i); j<=n; j+=i) {
                    prime[j]=0;
                } 
            }
        }
        
        count = 0;
        for(i=2; i<=n; i++) {
            count += prime[i];
        /*  cout << "prime[" << i << "] = " << prime[i] << endl; */
        }
        
        if(count%2) {
            cout << "Alice" << endl;
        }
        else {
            cout << "Bob" << endl;
        }
        
    }
    return 0;
}