#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
 int g ;
 cin>>g ;
 while(g--){
    int n ;
    cin>>n ;
    bool prime[n+1] ;
    for(int i=0 ; i<n+1 ; i++)
        prime[i]=true ;
    
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
             for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    
    int count = 0 ; 
    for (int p=2; p<=n; p++)
       if (prime[p])
          count++ ;
        
    if(count%2==0)
        cout<<"Bob"<<endl ;
    else
        cout<<"Alice"<<endl ;
 }
}