#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {

    int n,m ,x, co=0;

    cin>>x;
    for(int i=0;i<x;++i){
    int m;cin>>m;co=0;
if(m==1)cout<<"Bob"<<endl;else{
      int n=1, 

    assert(m - n > 0 && m - n < 1E6);
    int lst = -1;
    int ans = 0;
    vector<int> primes;
    for (int i = 2; i*i <= 1E9; i++) {
        bool ok = true;
        for (int j = 2; j*j <= i; j++) {
            if (i % j == 0) {
                ok = false;
                break;
            }
        }
        if (ok && i > 1) {
            primes.push_back(i);//this gives primes from 2 to 1E9
        }
    }

    for (int i = n; i <= m; i++) {
        bool ok = true;
        for (int j = 0; j < primes.size() && primes[j]*primes[j] <= i;
             j++) {
            if (i % primes[j] == 0) {
                ok = false;
                break;
            }
        }

        if (ok && i > 1) {
                co++;//cout<<i;//primes in arange
            
        }
    }
 if(co%2==0)   cout << "Bob" << endl;else cout << "Alice" << endl;
   
    
}
   //cout<<endl; 
    }
  
    return 0;
}