#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;

int no_of_primes(int n)
{
    int a[n+1];
    for(int i=0;i<=n;i++)
        a[i]=1;
    a[1]=0;
    int count=0;
    if(n>1)
        count=1;
    for(int i=4;i<n+1;i+=2)
        a[i]=0;
    for(int i=3;i<n+1;i+=2)
    {
        if(a[i]==1)
        {
            count++;
            for(int j=i*2;j<n+1;j+=i)
                a[j]=0;
        }
    }
    //cout<<count<<"\n";
    return count;
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int num=no_of_primes(n);
        if(num%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
    return 0;
}