#include<bits/stdc++.h>
using namespace std;
 
#define MP make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define PER(i,a,b) for(int i=b;i>=a;i--)
#define X first
#define Y second
 
//i/o
#define inp(n) scanf("%d",&n)
#define inpl(n) scanf("%lld",&n)
#define inp2(n,m) inp(n), inp(m)
#define inp2l(n,m) inpl(n), inpl(m)
 
 
//cost
#define lli long long int
#define MOD 1000000007
#define MOD_INV 1000000006
#define MAX 100009
#define INF 999999999
#define mp make_pair
 
//iterators
#define vitr std::vector<int>::iterator

bool prime[100005];
int A[100005];

void sieve()
{
    prime[0] = prime[1] = false;
    int count = 0;
    for (lli i = 2; i < 100005; ++i)
    {
        if(prime[i])
        {
            count++;

            for (lli j = i*i; j < 100005; j+=i)
            {
                prime[j] = false;
            }
        }
        A[i] = count;
    }
}

int main()
{
    int t;
    scanf("%d", &t);
    memset(prime, true, sizeof prime);
    sieve();

    while(t--)
    {
        int n;
        inp(n);

        if(A[n] == 0){
            printf("Bob\n");
            continue;
        }

        if(A[n]&1)
            printf("Alice\n");
        else
            printf("Bob\n");
    }
    return 0;
}