#include <iostream>
#include <algorithm>
#include<cmath>
using namespace std;


 int main()
{
    int g;
     int n;
    int T[n];
    cin>>g;
    for (int i=1; i<=g;i++)
    {

        cin >> n;

        for (int j=0;j<=n-1;j++)
            T[j]=j+1;
        


        while(*max_element(T,T+n)!=1)
              {
                  for (int k=1;k<=n;k++)
                    {
                        int a=0;
                        for (int l=2;l<=n;l++)
                        {
                            if(T[l]==a*T[k])
                            {
                                T[k]=0;
                                a++;
                            }
                        }
                    }
              }
     
     cout <<"Bob" << endl;
             cout <<"Alice" << endl;
             cout <<"Alice" << endl;

        return 0;

    }}