#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;
    bool flgs[100002]={false};
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n,i,j;
        cin >> n;
        int ans=0;
        for(i=2;i<=n;i++)
            {
                if(flgs[i]==false)
                    {
                        //cout<<"in if";
                        for(j=2;i*j<=n;j++)
                            flgs[i*j]=true;
                }
        }
        for(i=2;i<=n;i++)
            if(flgs[i]==false)
            {   
                //cout<<i<<endl;
                ans++;
        }
        if(ans%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}