//--------------------------------------------------------\\
/////****//***********GABBAR STUDIOWORKS*************\\****\\\


#include<bits/stdc++.h>
using namespace std;

typedef unsigned long long int ul;
typedef long long int ll;
typedef stack<int> stk;
typedef stack<char> stkc;
typedef stack<ll> stkl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair <int,char> pr;
typedef priority_queue <int> pq;
typedef map<string,int>  msi;

#define FF first
#define SS second
#define pb push_back
#define pob pop_back
#define mp make_pair
#define mod 1000000007
#define INF 1e9
#define fi(i,k,n) for(int i=k;i<n;i++)
#define ful(i,k,n) for(ul i=k;i<n;i++)
#define frev(i,k,n) for(int i=n-1;i>=k;i--)
#define pb push_back
#define ln(s) s.length()
#define scns(s) getline(cin,s)
#define be(x) (x).begin(),(x).end()
#define setpr(x,y) cout<<fixed<<setprecision(y)<<x
#define intsct(s1,s2,s3) set_intersection(s1.begin(),s1.end(),s2.begin(),s2.end(),inserter(s3,s3.begin()));

bool prime[100001];

void thenes()
{
    // Create a boolean array "prime[0..n]" and initialize
    //     // all entries it as true. A value in prime[i] will
    //         // finally be false if i is Not a prime, else true.
    memset(prime, true, sizeof(prime));
    int n= 100001;
    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;
        }
    }
}
    
ll cnt(ll n)
{
    ll count  = 0;

    for (int p=2; p<=n; p++)
        if (prime[p])
            count++;

    return count;
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    
    thenes();
    int test;
    cin>>test;

    while(test--)
    {
        ll n;
        cin>>n;
        
        ll count = cnt(n);

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

    return 0;
}