#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;

#include <bits/stdc++.h>
using namespace std;

int SieveOfEratosthenes(int n)
{
    int count = 0;
    
    // 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]) {
          count++;
       }
    }
    return count;
    
}

int main(){
    int g, num_primes;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        num_primes = SieveOfEratosthenes(n);
        if ((num_primes % 2) == 0) {
            printf("Bob\n");
        } else {
            printf("Alice\n");
        }
    }
    return 0;
}