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


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
    
    int count=SieveOfEratosthenes(n);
    if(count%2==0){
        cout<<"Bob"<<endl;
    }
    else{
        cout<<"Alice"<<endl;
    }
    }
    return 0;
}