#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;


int SieveOfEratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    int cnt = 0;
    bool prime[n+1];
    memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    // Print all prime numbers
    for (int p=2; p<=n; p++)
       if (prime[p])
          cnt++;
        return cnt;
}
 
// Driver Program to test above function
int main()
{
    int g,i;
    cin>>g;
    for(i=0;i<g;i++)
    {
        int n,cnt;
        cin>>n;
        cnt = SieveOfEratosthenes(n);
        if(cnt % 2 == 0)
           cout<<"Bob"<<endl;
        else
           cout<<"Alice"<<endl;
    }
    return 0;
}