#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<bits/stdc++.h>

using namespace std;

int prime[100000]={0};

vector<int> primes;

void sieve()
{
    prime[0] = 1;
    prime[1] = 1;
    for(int i=2;i<=100000;i++)
    {
        if(prime[i]==0)
        {
            primes.push_back(i);
            for(int j=2*i;j<=100000;j+=i)
                prime[j] = 1;
        }
    }
}

int binary(int x,int low,int high)
{
    int mid = (low+high)/2;
    //cout << mid << endl;
    if(primes[mid]==x)
        return mid;
    else if(x>primes[mid] && x<primes[mid+1])
        return mid;
    else if(x>primes[mid])
        return binary(x,mid+1,high);
    else
        return binary(x,low,mid-1);
}


int main()
{
    int T;
    cin >> T;
    sieve();
    while(T--)
    {
        int n;
        cin >> n;
        if(n==1)
        {
            cout << "Bob" << endl;
            continue;
        }
        int c = binary(n,0,primes.size());
        if(c%2 != 0)
            cout << "Bob" << endl;
        else
            cout << "Alice" << endl;
    }
    return 0;
}