#include <bits/stdc++.h>

using namespace std;
vector< int > prime ;
vector< bool > status( 1e5 ) ;

void initPrime( int num ) {

	status[ 0 ] = status[ 1 ] = true ;

	for( int i = 2 ; i*i <= num ; i++ )
		if( !status[ i ] ) 
		for( int j = i*i ; j <= num ; j+= i ) status[ j ] = true ;

	for( int i = 2 ; i <= num ; i++ )
		if( !status[ i ] ) prime.push_back( i ) ;


}

int main(){
    
	initPrime(1e5) ;	
    
	int g ;
	cin >> g ;
	while( g-- ) {

		int n ;
		cin >> n ;
		
		int pos = upper_bound( prime.begin() , prime.end() , n ) - prime.begin()  ;

		if( pos%2 ) cout << "Alice" << endl ;
		else cout << "Bob" << endl ;
	}

           
    return 0;
}