#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(){
    bool sieve[100001];
    memset(sieve, true, sizeof(sieve));
    int count=0, counts[100001]={0};
    sieve[1]=false;
    int i,j;
    for(i=2;i*i<=100000;i++){
        if(sieve[i]==true){
            ++count;
            for(j=i*i;j<=100000;j+=i){
                sieve[j]=false;
            }
        }
        counts[i]=count;
    }
    while(i<=100000){
        if(sieve[i]==true){
            count++;
        }
        counts[i]=count;
        ++i;
    }
    int t,n;
    cin>>t;
    while(t--){
        cin>>n;
        if(counts[n]&1){
            cout<<"Alice"<<endl;
        }
        else{
            cout<<"Bob"<<endl;
        }
    }
    return 0;
}