#include<bits/stdc++.h>
using namespace std;

bool isPrime[100005];
int prime[100005];
int main()
{
      for(int i = 0; i < 100005; i++) isPrime[i] = true;
	isPrime[0] = isPrime[1] = false;
	for(int i = 2; i < 100005; i++)
		if(isPrime[i])
			for(int j = i * 2; j < 100005; j += i)
				isPrime[j] = false;
int cnt = 0;
	for(int i = 0; i < 100005; i++)
		if(isPrime[i])
			prime[cnt++] = i;
			int t;
			cin>>t;
			int arr[100005];
			arr[0]=0;
			int ccnt=0;
			for(int i=0;i<100005;i++)
			{
				if(isPrime[i]==true)
					ccnt++;
				arr[i]=ccnt;
			}
			while(t--)
			{
				int c=0;
				int n;
				cin>>n;
				if(arr[n]%2==0)
					cout<<"Bob"<<endl;
				else
					cout<<"Alice"<<endl;
			}

}