#include<bits/stdc++.h>

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define len(s) s.length()
#define forp(i,a,b) for( i=a;i<=b;i++)
#define FOR(tt,a,b) for(int tt=a;tt<=b;tt++)
#define rep(i,n)    for( i=0;i<n;i++)
#define ren(i,n)    for( i=n-1;i>=0;i--)
#define forn(i,a,b) for( i=a;i>=b;i--)
#define all(v) v.begin(),v.end()
#define b(v) v.begin()
#define e(v) v.end()
#define mem(n,m) memset(n,m,sizeof(n))
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define pll pair<long long,long long>
#define vii vector<int>
#define vll vector<long long>
#define gl(cin,s)  getline(cin,s);
#define bitc(n) __builtin_popcountll(n)
#define present(s,x) (s.find(x) != s.end()) 
#define cpresent(s,x) (find(all(s),x) != s.end()) 
#define tr(container, it) for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++) 

#define boost ios_base::sync_with_stdio(0)
#define MOD 1000000007
#define EPSILON 1e-9
#define PI 3.14159265358979323846
#define SIZE 1000001

typedef long long  ll;
typedef unsigned long long ull;
typedef long double  ldo;
typedef double  db ;
using namespace std;
/*Sieve Function*/
bool sieve[SIZE];
vector<int> s;
void sievep()
{
	/* Please Don't Change The Datatype Of Any Number To int Even If The Max Value Of SIZE is 1e6 */
	ll i,p;
	s.pb(2);
	for(i=3;i<SIZE;i=i+2)
	{
		if(sieve[i]==0)
		{
			s.pb(i);
			p=i;
			while(i*p<SIZE*1LL)
			{
				sieve[i*p]=1;
				p=p+2;
			}
		}
	}
	return ;
}
int main()
{  	
	/* #ifndef ONLINE_JUDGE
	freopen(fi, "r", stdin);
	#endif */
	//freopen("route.in","r",stdin);
	//freopen("route.out","w",stdout);
	//cin.ignore();
	//cin.clear();
	boost;
	//cin.tie(0);
	//cout<<"Case #"<<tt<<": ";
	sievep();
	int n,t;
	cin>>t;
	while(t--){
		cin>>n;
		if(n==1){
			cout<<"Bob\n";
			continue;
		}
		int temp = lb(all(s),n)-s.begin();
		if(s[temp]>n)
		temp--;
		temp++;
		if(temp%2==0){
			cout<<"Bob\n";
		}
		else{
			cout<<"Alice\n";
		}
	}
	return 0;
}