#include<bits/stdc++.h>// <3 Nandini <3
using namespace std;
#define gc getchar
#define mp make_pair
#define pb push_back
#define sc scanint
#define dc print_int
#define f first
#define s second
#define ret return 0;
#define rf std::ios::sync_with_stdio(false);
#define mi 1000000007
#define tl int t;sc(t);while(t--)
#define in int n;sc(n);
#define vin vi arr; for(int i=0;i<n;i++){int a;sc(a);arr.pb(a);}
#define st string s1; getline(cin>>ws,s1);
#define sorta sort(arr.begin(),arr.end());
#define reva reverse(arr.begin(),arr.end());
#define pf(a) printf("%d",a);
#define mina *min_element(arr.begin(),arr.end())
#define maxa *max_element(arr.begin(),arr.end())
#define sl scanlong
typedef vector<int> vi;
typedef vector<pair<int,int> > vii;
typedef long long int ll;
typedef pair<int, int> pii;
typedef unsigned long long int ull;


void scanint(int &x)
{
    register int c = gc();
    x = 0;
    int neg = 0;
    for(;((c<48 || c>57) && c != '-');c = gc());
    if(c=='-') {neg=1;c=gc();}
    for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
    if(neg) x=-x;
}
void scanlong(ull &x);
void scanlong(ull &x)
{
        int flag=0;
        register int c = gc();
        if(c == '-') flag=1;
	x = 0;
	for(;(c<48 || c>57);c = gc());
	for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
        if(flag == 1)x=-x;
}

int main()
{
int t;
cin>>t;
while(t--)
{
    struct pair{int x;int y;}obj[32000];
    vector<int> arr;
    int n,count=0,i=1,j,m=0,count1=0;
    cin>>n;
    bool prime[n+1];
    memset(prime, true, sizeof(prime));

    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }

    // Print all prime numbers
    for (int p=2; p<=n; p++)
       if (prime[p])
          arr.push_back(p);
          if((arr.size()%2)==0)
            cout<<"Bob"<<endl;
          else cout<<"Alice"<<endl;}
          ret}