#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> p(1005,0);

int prime(int t)
    {
    int ans=0,flag=0;
    if(t>1000){p.resize(100005); flag=1;}
    if(t==1||t==2||t==3){return (t-1);}
    for(int i=2;i<=t;i++)
        {
        if(p[i]==1){continue;}
        for(int j=2;j<=t/2;j++){
            if((flag==0)&&(i*j>1001)){break;}
            if((flag==1)&&(i*j>100001)){break;}
            p[i*j]=1;
        }
    }
    for(int i=2;i<=t;i++)
        {
        if(p[i]==0){ans++;}
    }
    return ans;
}


int main(){
    int g;
    cin>>g;
    while(g--){
        int n;
        cin>>n;
        int x=prime(n);
        if(x%2==0){cout<<"Bob"<<"\n";}
        if(x%2==1){cout<<"Alice"<<"\n";}
    }
    return 0;
}