#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;
bool isPrime(int n) {
    if (n == 1) {
        return false;
    }
    if ((n == 2) || (n == 3)) {
        return true;
    }
    
    if ((n%2 == 0) || (n%3 == 0)) {
        return false;
    }
    
    int i = 5;
    int w = 2;
    
    while (i*i <=n) {
        if (n%i == 0){
            return false;
        }
        i += w;
        w = 6-w;
        
    }
    
    return true;
}

int  primeCount(int n)
{
    bool prime[n+1];
    memset(prime, true, sizeof(prime));
    int primeCount = 0;
    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])
          primeCount++;
    }
    
    return primeCount;
}


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
   
    
    int noOfPrimes = primeCount(n);
   /* int i = 1;
    
    while (i <=n) {
        
        if (isPrime(i)) {
            noOfPrimes++;
        }
        i++;
    }*/
    
    if (noOfPrimes %2 == 0) {
        cout<<"Bob"<<endl;
    } else {
        cout<<"Alice"<<endl;
    }
     }
    return 0;
}