#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;
    for(int a0 = 0; a0 < g; a0++)
        {
        int n;
        cin>>n;
        // your code goes here
           // cout<<"n is "<<n<<endl;

        if(n==1)
            cout<<"Bob"<<endl;
        else
            {

            int arr[n+2]={0};
            int count=0;
            for(int i=2;i<=n;i++)
                {

                if(arr[i]==0)
                    {
                    count++;
                    for(int j=i;j<=n;j=j+i)
                        {
                        arr[j]=1;
                    }

                }
            }

               // cout<<"count is "<<count<<endl;
            if(count%2==0)
                cout<<"Bob"<<endl;
            else
                cout<<"Alice"<<endl;



        }

    }
    return 0;
}