#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long LL;
const int S = 100003;
const int MOD = 1e9+7;
const double pi = 2 * acos( 0.0 );

inline int _Int(){ int x; scanf( "%d", &x ); return x; }
inline LL _LLi(){ LL x; scanf( "%lld", &x ); return x; }
void pruts(){ puts( "-1" ); exit( EXIT_SUCCESS ); }

int dirX[] = { 1, 0, -1, 0, 1, -1, 1, -1 };
int dirY[] = { 0, 1, 0, -1, 1, -1, -1, 1 };
int rX[] = { 1, 1, 2, 2, -1, -1, -2, -2 };
int rY[] = { 2, -2, 1, -1, 2, -2, 1, -1 };

template < class T > T tri_Area( T x1, T y1, T x2, T y2, T x3, T y3 ){ return abs( x1*( y2-y3 ) - y1*( x2-x3 ) + ( x2*y3-x3*y2 ) ); };
template < class T > T Distance( T x1, T y1, T x2, T y2 ){ return sqrt( ( x1-x2 ) * ( x1-x2 ) + ( y1-y2 ) * ( y1-y2 ) ); };
template < class T > T bigMod( T n, T p, T m ){ if( p == 0 )return 1; if( p&1 )return ( n*bigMod( n, p-1, m ) )%m; T x = bigMod( n, p/2, m ); return ( x*x )%m; };

int sset(int N, int pos){return N=N|(1<<pos);}
bool check(int N, int pos){return (bool)(N&(1<<pos));}
int reset(int N, int pos){return N=N&~(1<<pos);}
/*******************###########################################********************
********************##   MD. YA-SEEN ARAFAT(ThunderStroke)   ##********************
********************##    CSE, University of Asia Pacific    ##********************
********************###########################################********************/

int prime[ S ];
int freq[ S ];

void seive(){
    int sq = sqrt(S);
    for( int i = 2; i <= sq; i++ ){
        if( !prime[ i ] ){
            for( int j = i+i; j <= S; j += i )prime[ j ] = 1;
        }
    }
    for( int i = 2; i < S; i++ ){
        if( !prime[ i ] )freq[ i ]++;
        freq[ i ] += freq[ i-1 ];
    }

}

void Love(){
    seive();
    int g = _Int();
    while( g-- ){
        int n = _Int();
        puts( ( freq[ n ]&1 )? "Alice" : "Bob" );
    }
}

int main(){
    #ifndef ONLINE_JUDGE
//        freopen("in.txt", "r", stdin);
//        freopen("n.txt", "w", stdout);
    #endif
    Love();
    return 0;
}