#include<iostream>
using namespace std;
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <limits.h>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <vector>
#include <numeric>
//setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//setprecision - cout << setprecision (4) << f << endl; Prints x.xxxx
//  INT_MIN Minimum value for a variable of type int.
//  INT_MAX Maximum value for a variable of type int.
//  UINT_MAX Maximum value for a variable of type unsigned int.
//  LONG_MIN Minimum value for a variable of type long.
//  LONG_MAX Maximum value for a variable of type long.
//  ULONG_MAX Maximum value for a variable of type unsigned long.
#define MOD 1000000007
bool isprime(int n)
{
    if (n <= 1)  return false;
    if (n <= 3)  return true;
    if (n%2 == 0 || n%3 == 0) return false;
    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
    return true;
}
int main(void)
{
	int t,cnt;
	cin>>t;
	while(t--)
	{
        cnt=0;
		int i,n;
		cin>>n;vector<int>vec;
		for(i=1;i<=n;i++)
			vec.push_back(i);
		while(1)
		{
		vector<int>::iterator it=vec.begin();
		for(it=vec.begin();it!=vec.end();it++)
		{
			if(isprime(*it))
				break;
		}
		if(it==vec.end()) break;
		int k=*it;
		vec.erase(it);
		for(;it!=vec.end();it++)
		{
			if(*it%k==0)
				vec.erase(it);
		}
		cnt++;
		}
		if(cnt%2==0) cout<<"Bob"<<endl;
		else cout<<"Alice"<<endl;
	}
	return 0;
}