#include <bits/stdc++.h>
using namespace std;

#define REP(i, a, b) for (int i = a; i <= b; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define foreach(it, ar) for ( typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++ )
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define PI 3.1415926535897932385
#define uint64 unsigned long long
#define Int long long
#define int64 long long
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define ff first
#define ss second
#define bit(n) (1<<(n))
#define Last(i) ( (i) & (-i) )
#define sq(x) ((x) * (x))
#define INF INT_MAX
#define mp make_pair
#define MAX  200000
bool seive[ MAX + 1 ] ;
int  presum [ MAX + 1 ] ;

void pre(  )
 {
    FOR( i , MAX )seive[i] = true ;

    seive[0] = false ;
    seive[1] = false ;

    for( int  i = 2 ; i <= MAX ; i ++  )
     if( seive[i] )
     for( int  j = 2 ; i*j <= MAX ; j ++ )
       {
          seive[i*j] = false ;
       }

    presum[ 0 ] = 0 ;
    for( int  i = 1 ; i <= MAX ; i ++  )
     {
        presum[i] += presum[i-1] ;
        if( seive[i] )presum[i] += 1 ;

     }

 }
int main ( )
 {
   pre() ;
   int t ;
   cin >>  t ;
   while( t-- )
    {
       int n ;
       cin >> n ;
       if(  presum[n]  & 1 )cout<<"Alice"<<endl ;
       else cout<<"Bob"<<endl;

    }


 }