#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>
#define n 100005

using namespace std;


        bool * isPrime = new bool [n/2];
        vector<int> a(1);
        int counter;
        void seive(){
            int i;
            counter=1;
            for (int i=0; i < n/2; ++i)
                isPrime [i] = true;
            
            a.push_back(2);
            counter++;
            int N=sqrt(n);
            for (i = 3; i < N; i += 2) {
                
                if (isPrime [i / 2]) {
                    
                    a.push_back(i);
                    counter++;
                    
                    for (long long  j = i * i; j < n; j += 2 * i)
                        isPrime [j / 2] = false;
                }
            }
            
            for(;i<n;i += 2){
                if(isPrime[ i/2 ]){
                    a.push_back(i);
                    counter++;
                }
            }
        }

int main(){
    seive();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int ni;
        cin >> ni;
        // your code goes here
        int ans=upper_bound(a.begin(),a.end(),ni)-a.begin();
        ans--;
        //cout<<ans;
        if(ans%2==0){
          cout<<"Bob"<<endl;  
        }
        else{
            cout<<"Alice"<<endl;  
        }
    }
    return 0;
}