#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

const int N = 100005;
bool not_prime[N];
int cnt[N];
void init()
{
    not_prime[1] = true;
    for(int i=2;i<N;i++) if(!not_prime[i]&&i<=N/i)
    {
        for(int j=i*i;j<N;j+=i) not_prime[j] = true;
    }
    for(int i=1;i<N;i++) cnt[i]=cnt[i-1]+(!not_prime[i]);
//    for(int i=1;i<=10;i++) printf("%d  %d \n",i,not_prime[i]);
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int T;
    scanf("%d",&T);
    init();
    while(T--)
    {
        int n;
        scanf("%d",&n);
        printf("%s\n",cnt[n]&1?"Alice":"Bob");
    }
    return 0;
}