#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
 
ll pwr(ll base, ll p, ll mod = MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}
 
ll gcd(ll a, ll b){
    if(b == 0)  return a;
    return gcd(b, a%b);
}

typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<int> VI;

int n,g,p[100005],isPrime[100005];

void fun()
{
    for(int i=2;i<100005;i++)
    {
        if(isPrime[i] == 1)
        {
            //cout<<i<<" ";
            for(int j=2*i;j<100005;j+=i)
                isPrime[j] = 0;
        }
    }

    for(int i=1;i<100005;i++)
        isPrime[i] = isPrime[i]+isPrime[i-1];
}
int main()
{
    for(int i=2;i<100005;i++)
        isPrime[i] = 1;
    fun();

    cin>>g;
    for(int i=0;i<g;i++)
    {
        cin>>n;
        if(isPrime[n]%2 == 0)
            cout<<"Bob"<<"\n";
        else
            cout<<"Alice\n";

        
    }
    
    return 0;
}