#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>
#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        ll n,cnt=1;
        cin >> n;
        bool b[n+1];
        string s="Alice";
        memset(b,true,sizeof(b));
        // your code goes here
        if(n==1 || n==3)
            {
            cout<<"Bob"<<endl;
        }
       else if(n==2 || n==5)
            {
            cout<<"Alice"<<endl;
        }
        else{
        for(ll i=2;i*i<=n;i++)
            {
            if(b[i])
                {
                for(ll j=i*i;j<=n;j+=i)
                    {
                    b[j]=false;
                }
            }
        }
        for(ll i=2;i<=n;i++)
            {
            if(b[i])
                {
            if(cnt%2!=0)
                {
                s="Alice";
            }
            else
                {
                s="Bob";
            }
            ++cnt;
            }
        }cout<<s<<endl;
        }
        }
    return 0;
}