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


bool isPrime(long long int a,vector<long long int> vec)
    {
    
    if(a==1)
        return false;
    long long int i,j;
    if(a==2)
        return true;
    for(i=0;i<vec.size();i++)
        {
        if(a%vec[i]==0)
            return false;
    }
    
    return true;
    
}

long long int myprime(long long int n)
    {
    
    bool prime[n+1];
   for(long long int i = 0;i<=n;i++)
       {
       prime[i] = true;
   }
    
    for (long long 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 (long long int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    long long int c=0;
    for(long long int i=2;i<=n;i++)
        {
        if(prime[i])
            c++;
    }
    
    return c;
}

int main() {
    
    long long int i,j,m,n,t,p,flag,c;
    
    cin>>t;
    
    long long int res[t];
    
    for(j=0;j<t;j++)
        {
    
     cin>>n;
        vector<long long int> vec;
    c = 0;
      c = myprime(n);
        
        if(c%2==0)
            {
            
            flag = 0;
        }
        
        else{
            flag = 1;
        }
        
        res[j] = flag;
        
    }
    
    
    for(j=0;j<t;j++)
        {
        if(res[j]==0)
            cout<<"Bob"<<endl;
        else 
            cout<<"Alice"<<endl;
    }
    
    return 0;
}