#include <cmath>
#include<bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
   int g;
    cin>>g;
    bool prime[100001];
    memset(prime,true,100001);
    for (int p=2; p*p<=100001; p++)
	{
		if (prime[p] == true)
		{
			for (int i=p*2; i<=100001; i += p)
				prime[i] = false;
		}
	}
    for(int i=0;i<g;i++)
        {int f=0;
        long long int n;
        cin>>n;
        for(int j=2;j<=n;j++)
            {
            if(prime[j]==true)
                {f++;}
        }
        if(f%2==0)
            {cout<<"Bob"<<endl;}
        else
            {cout<<"Alice"<<endl;}
    }
    return 0;
}