/*input
3
1
2
5
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
//loops
#define f(i,s,n) for(ll i=(ll)s;i<(ll)n;i++)
#define rf(i,n,s) for(ll i=(ll)(n-1);i>=(ll)s;i--)
//reset
#define ms0(X) memset((X), 0, sizeof((X)))
#define ms1(X) memset((X), -1, sizeof((X)))
//IO
#define bio ios_base::sync_with_stdio;cin.tie(NULL)
//STL
#define pb push_back
#define pii pair<ll,ll>
#define vll vector<ll>
#define vpii vector<pii >
#define mll map<ll, ll>
#define mpii map<pii,ll> 
#define msll map<string, ll> 
#define sortv(v) sort(v.begin(),v.end())
#define F first
#define S second
//standard values
#define mod (ll)(1e9+7)
#define INF (ll)1e16
#define MAXN (ll)(1e5+5)
//comparator
bool cmp(pii a,pii b){
  if(a.F==b.F) return a.S<b.S;
  else return a.F<b.F;
}
ll exp(ll a, ll b){ll ans=1;while(b!=0){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}
/********************************************************************************************************/
ll pr[MAXN];
ll cnt[MAXN];
void sieve()
{
  f(i,2,sqrt(MAXN)+1){
    if(pr[i]==0){
      for(int j=i*i;j<MAXN;j+=i){
        pr[j]=1;
      }
    }
  }

  f(i,2,MAXN){
    if(pr[i]==0){
      cnt[i]=cnt[i-1]+1;
    }
    else{
      cnt[i]=cnt[i-1];
    }
  }
}
int main() 
{
  bio;
  ll tc;
  sieve();
  cin>>tc;
  while(tc--){
    ll n;
    cin>>n;
    if(cnt[n]%2==1){
      cout<<"Alice"<<endl;
    }
    else{
      cout<<"Bob"<<endl;
    }
  }
  return 0;
}