#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;
    vector<bool> arr(100001,true);
    for(int i=2;i*i<=100000;i++)
        {
        if(arr[i]==true)
            {
            for(int j=2*i;j<=100000;j+=i)
                {
                arr[j]=false;
            }
        }
    }
    vector<int> ans(100001,0);
    int ct=0;
    for(int i=2;i<100001;i++)
        {
        if(arr[i]==true)
            ct++;
        ans[i]=ct;
    }
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(n==1)
            cout<<"Bob\n";
        else
        {if(ans[n]%2==0)
         cout<<"Bob\n";
       else 
           cout<<"Alice\n"; 
    }
    }
    return 0;
}