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



int SieveOfEratosthenes(int n)
{
    //bool prime[n+1];
    int * prime = (int *)calloc(n+1,sizeof(int));
    //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] == 0)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = 1;
        }
    }
     int count=0;
    // Print all prime numbers
    for (int p=2; p<=n; p++)
      { if (prime[p]==0)
          {
           //cout << "" ;
           //printf("");
           count+=1;
          }
      }
    return count;
}


int main(){
    int g; 
    scanf("%d",&g);
    for(int a0 = 0; a0 < g; a0++){
        int n; 
        scanf("%d",&n);
        if(n==1)
            {printf("Bob\n");
            continue;
            }
        int x = SieveOfEratosthenes(n);
            
        if(x%2==1)
            printf("Alice\n");
        else
            printf("Bob\n");
    }
    return 0;
}