#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;
bool isprime(int i)
    {
    int count=0;
    for(int j=1;j<=sqrt(i);j++)
        {
        if(i%j==0)
            count++;
    }
    if(count>1)
        return false;
    else
        return true;
    
}
int getprime(int n)
    {
    int count=0;
    for(int i=2;i<=n;i++)
        {
        if(isprime(i))
            count++;
         
    }
    return count;
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(n==1)
        {cout<<"Bob"<<endl;
         continue;
        }
        int total=getprime(n);
       
        if(total%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
       
    }
    return 0;
}