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

#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2*acos(0)
#define PI 3.14159265358979323846264338

typedef long long ll;
typedef pair < int , int > pii;
typedef pair < ll , ll > pll;
const int N = 100100;

inline int in() {int x; scanf("%d",&x); return x;}
inline ll lin() {ll x; scanf("%lld",&x); return x;}

int fx[]={1,-1,0,0};
int fy[]={0,0,-1,1};

bool f_prime[N];
int prime[N], sz;

void Sieve(){
    for(int i = 4;i < N; i+=2) f_prime[i] = 1;
    for(int i = 3;i * i <= N; i+=2){
        if(f_prime[i] == 0){
            for(int j = i * i;j < N; j += i){
                f_prime[j] = 1;
            }
        }
    }

    prime[++sz] = 2;
    for(int i = 3;i < N; i+=2){
        if(f_prime[i] == 0){
            prime[++sz] = i;
        }
    }
}

int main(){
    int test = in();
    Sieve();
    while(test--){
        int n = in();

        if(n == 1){
            puts("Bob");
        }else {
            int x = upper_bound(prime + 1, prime + sz + 1, n) - prime - 1;
            if(x % 2 == 0) puts("Bob");
            else {
                puts("Alice");
            }
        }
    }
}