#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

#include<bits/stdc++.h>
using namespace std;
int arr[100005];
void seive()
{
    int i,j;
    arr[1] = -1;    
    for(i=2;i<=100000;i++)
    {
    	if(arr[i])
    	 continue;
    	for(j=2;j*i<=100000;j++)     
		  {
		     arr[j*i]=1;      	
		  } 	 
	}
	
}
int preprocess[100005];
int main(){
    seive();
    preprocess[1]=0;
    int last = 0;
    for(int i=2;i<=100000;i++)
        {
          if(arr[i]==0)
               {
                last++;
          }
        preprocess[i]=last;
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(preprocess[n]%2==0)
            printf("Bob\n");
        else
            printf("Alice\n");
    }
    return 0;
}