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


int main(){
    int g;
    cin >> g;
    
    bool f[100001]={false};
    vector<int>p;
    p.push_back(2);
    
    for(int i=3;i<=100000;i+=2){
        
        if(!f[i]){
            
            p.push_back(i);
            
            for(int j=2*i;j<=100000;j+=i)
                f[j]=true;
        }
    }
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        
        int s=lower_bound(p.begin(),p.end(),n)-p.begin()+1;
        
        if(n>2&&n%2==0||f[n]) s--;
        
        if(s%2!=0&&n!=1) cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }
    return 0;
}