#include <bits/stdc++.h>
#define INF 100000009
#define mod 1000000007
#define PI 3.14159
#define vi vector<int>
#define ll long long
#define ii pair<int, int>
#define vii vector<ii>
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define mt make_tuple
#define eb emplace_back
#define CLR(arr) memset(arr, 0, sizeof(arr))
#define FAST_IO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;

bitset<1000001> sieve;
vi primes;
int sieve_size;

void gen_primes(int limit)
{
    sieve_size = limit;
    sieve[1] = 1;
    for(int i=2; i<=limit; ++i)
        if(!sieve[i])
        {
            primes.pb(i);
            for(int j=i+i; j<=limit; j+=i)
                sieve[j] = 1;
        }
}



int main()
{
    gen_primes(100005);
    int g;
    cin>>g;
    while(g--)
    {
        int n;
        cin>>n;
        int num = upper_bound(primes.begin(), primes.end(), n) - primes.begin();
        if(num%2)
        {
            cout<<"Alice"<<endl;
        }
        else
            cout<<"Bob"<<endl;
    }
    return 0;
}