#include<bits/stdc++.h>

using namespace std;

typedef pair<int,int>   II;
typedef vector< II >      VII;
typedef vector<int>     VI;
typedef vector< VI > 	VVI;
typedef long long int 	ll;

#define mod 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define forn(i, n) for(int i = 0; i < int(n); ++i)
#define cases int t;  scanf("%d",&t);   while(t--)
#define si(n) scanf("%d",&n)
#define dout(n) printf("%d\n",n)
#define sll(n) scanf("%lld",&n)
#define lldout(n) printf("%lld\n",n)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)

int primes[100001];

void sieve(int n)
{
    int i, j;
    for (i=0;i<n;i++)
        primes[i]=1; // we initialize the sieve list to all 1's (True)
    primes[0]=0,primes[1]=0; // Set the first two numbers (0 and 1) to 0 (False)
    for (i=2;i<sqrt(n);i++) // loop through all the numbers up to the sqrt(n)
        for (j=i*i;j<n;j+=i)
            primes[j] = 0;
}

int main()
{
    sieve(100005);
    cases
    {
        int n,sum=0;
        cin>>n;
        forn(i,n)
            if(primes[i+1]==true)
                sum++;
        if(sum%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
    return 0;
}