#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <stack>
#define MOD 1000000007
#define endl '\n'
#define REP(i,n) for(int i=0;i<n;i++)

using namespace std;

int arr[100005];
int main()
{
    for(int i=2;i<100003;i+=1){
        if(arr[i]==0)
        {
            for(int j=i+i;j<100004;j+=i){
                arr[j]=1;
            }
        }
    }
    int noofprimes[100001];
    noofprimes[0]=noofprimes[1]=0;
    for(int i=2;i<100001;i++)
    {
        noofprimes[i]=noofprimes[i-1]+(arr[i]^1);
    }
    int t;
    cin>>t;
    while(t--)
    {
        int l;
        cin>>l;
        if(noofprimes[l]%2)
            cout<<"Alice\n";
        else
            cout<<"Bob\n";
    }
    return 0;
}