#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;
int SieveOfEratosthenes(int n,int c);

int main(){
    int g,c,f;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        /*int a[n+1];
        for(int i=0;i<n+1;i++)
            a[i]=i;
        c=0;
        for(int i=2;i<n+1;i++)
        {
            f=0;
            if(a[i]!=0)
            {
                for(int j=2;j<sqrt(i);j++)
                {   
                    if(a[j]!=0&&i%j==0)
                        f=1;
                }
                if(f==0)
                {
                    c++;
                    for(int j=i;j<n;j++)
                    {
                        if(a[j]!=0&&a[j]%i==0)
                            a[j]=0;
                    }
                }
            }
            
        }
        */
        c=0;
        c = SieveOfEratosthenes(n,c);
   
        if(c&1)
            cout<<"Alice";
        else
            cout<<"Bob";
        cout<<endl;
    }
    return 0;
}
int SieveOfEratosthenes(int n,int c)
{
    // 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.
    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])
       {
          c++;
    }
    return c;
}