#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 A[100001] = {0};
    A[0]=1;
    A[1]=1;
    for(int i=2; i<=100001; i++){
        if(A[i]==0){
            int j=2*i;
            while(j<=100001){
                A[j] = 1;
                j+=i;
            }
        }
    }

    //for(int i=0; i<=10; i++) cout<<A[i]<<" ";
    int g;
    cin >> g;
    while(g--){
        int n; 
        cin>>n;
        int count=0;
        for(int i=0; i<=n; i++) if(A[i]==0) count++;
            
        //cout<<count<<" ";
        
        if(count%2) cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }
    return 0;
}