#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 prime[100001];
void SieveOfEratosthenes(int n){memset(prime, true, sizeof(prime));for (int p=2; p*p<=n; p++){if (prime[p] == true){for (int i=p*2; i<=n; i += p) prime[i] = false;}}}

int main(){
    int g;
    cin >> g;
    SieveOfEratosthenes(100000);
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
         int primes=0;
        for(int i=2;i<=n;i++)
            if(prime[i]) primes++;
        if(primes%2==0)
            cout<<"Bob\n";
        else
               cout<<"Alice\n";
    }
    return 0;
}