#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>

using namespace std;

vector<int> primes;
bitset<100001> test;

void sieve()
{
    test.reset();

    for (int i=2;i<1000;i++)
    {
        if (test[i]) continue;

        int k=i*i;

        while (k<100001)
        {
            test.set(k,true);
            k+=i;
        }
    }

    for (int i=2;i<100001;i++)
        if (!test[i])
            primes.push_back(i);
}

int solve(int n)
{
    if (n<2) return 2;

    int r,l,mid=0;

    r=primes.size()-1;
    l=0;

    while (l<=r)
    {
        mid=(l+r)/2;

        if (primes[mid]<=n)
        {
            if (primes[mid+1]>n)
                break;
            else
                l=mid+1;
        }
        else r=mid-1;

    }
    return 2- (mid+1)%2;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    sieve();

    int t;
    cin>>t;

    while (t--)
    {
        int n;
        cin >>n;

        cout<<((solve(n)==1)?"Alice":"Bob")<<endl;
    }

    return 0;
}