#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;

vector<int> getPrimes(){
    int n = 100001;
    vector<bool> p(n);
    for(int i=0;i<n;++i) p[i]=true;
    vector<int> ret;
    ret.push_back(2);
    for(int i=3;i*i<=n;i+=2){
       if(p[i]==false) continue;
        for(int j=i*i;j<=n;j+=i)
           p[j] = false;
    }
    
    for(int i=3;i<=n;i+=2) if(p[i]) ret.push_back(i);
        
    return ret;
}

int main(){
    int g;
    cin >> g;
    
    vector<int> p = getPrimes();
    //for(int i=0;i<p.size();++i) cout<<p[i]<<" ";cout<<endl;
    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        
        int ret = 0;
        for(int i=0;i<p.size();++i) if(p[i]<=n) ++ret;
        
        string winner = "Alice";
        if(ret%2==0) winner = "Bob";
        cout<<winner<<endl;
    }
    

    
    
    return 0;
}