#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;

void SieveOfEratosthenes(int n)
{
bool primeabc[n+1];

primeabc[1]=false;
for(int i=0;i<=n;i++) primeabc[i]=true;
for (int j=2; j*j<=n; j++)
{
if (primeabc[j] == true)
{
for (int i=j*2; i<=n; i += j)
primeabc[i] = false;
}
}
int count=0;
for(int j=2;j<=n;j++){
if(primeabc[j]) count++;
}
if(count&1) cout<<"Alice\n";
else cout<<"Bob\n";
}
int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        SieveOfEratosthenes(n);
        // your code goes here
    }
    return 0;
}