#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>
#include <string>

using namespace std;

#define MAX_LEN 100001
char is_p[ MAX_LEN ];

int main(){
    
    memset( is_p, 1, sizeof( char ) * MAX_LEN );

    is_p[ 0 ] = 0;
    is_p[ 1 ] = 0;

    int p = 2;
    while ( p * p < MAX_LEN ) {
        int q = p * p;
        while ( q < MAX_LEN ) {
            is_p[ q ] = 0;
            q+=p;
        }
        p++;
        while ( is_p[ p ] == 0 ) {
            p++;
        }
    }
    
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes 
        int res = 0;
        for ( int i = 1; i <= n; ++i ) {
            if ( is_p[ i ] == 1 ) {
                res++;
            }
        }
        if ( res % 2 == 0 ) {
            cout << "Bob" << endl;
        } else {
            cout << "Alice" << endl;
        }
    }
    return 0;
}