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

int numberofprime(int low,int high){
 int c=0;
    int flag;
    while (low < high)
    {
        flag = 0;

        for(int i = 2; i <= low/2; ++i)
        {
            if(low % i == 0)
            {
                flag = 1;
                break;
            }
        }
        
        if (flag == 0&&low!=1)
        {//cout << low << " ";
        c++;}

        ++low;
    }
    return c;
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
    int g,n;
    cin>>g;
    while(g--)
        {cin>>n;
        
        
        int a=numberofprime(1,n+1);
         if(a%2!=0)
             cout<<"Alice"<<endl;
         else cout<<"Bob"<<endl;
    }
    
    
    
   
    return 0;
}