#include<bits/stdc++.h>
#define gc getchar_unlocked
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define sz size()
#define ff first
#define ss second
#define all(x) (x).begin(),(x).end()
#define mset(m,v) memset(m,v,sizeof(m))
#define ABS(a,b) ((a) < (b) ? (b)-(a) : (a)-(b))
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
#define remax(a,b) (a)=max((a),(b));
#define remin(a,b) (a)=min((a),(b));
#define nu 100005
#define pnu 100005
#define MOD 1000000007
#define MAX 1000000000
#define MAXL 1000000000000000000LL
#define nmod(a,b) ((a%b)+b)%b
 
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef stack<int> sti;
typedef stack<char> stc;
typedef queue<int> qi;
typedef pair<int,int> ii;
typedef pair<int,ll> il;
typedef pair<string,int> si;
typedef pair<string,string> ss;
typedef pair<ss,int> ssi;
typedef pair<int,string> is;
typedef pair<int,ii> iii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<si> vsi;
typedef vector<is> vis;
typedef vector<vii> vvii;
typedef vector<string> vs;
typedef vector<ss> vss;
typedef vector<ssi> vssi;
typedef map<char,int> mci;
typedef unordered_map<string,int> umsi;
inline int inp()
    {
    int NR=0,sign=1;
    char c=gc();
    while( c < 48 || c > 57 ){if(c=='-')sign=0; c=gc();}
    while(c>47 && c< 58)
    {
    NR = (NR << 3) + (NR << 1) + (c - 48);
    c=gc();
    }
    return (sign?NR:(-NR));
    }
	inline int inpl()
    {
    ll NR=0;
	int sign=1;
    char c=gc();
    while( c < 48 || c > 57 ){if(c=='-')sign=0; c=gc();}
    while(c>47 && c< 58)
    {
    NR = (NR << 3) + (NR << 1) + (c - 48);
    c=gc();
    }
    return (sign?NR:(-NR));
    }
inline int in()
    {
    int NR=0;
    char c=gc();
    while( c < 48 || c > 57 ){c=gc();}
    while(c>47 && c< 58)
    {
    NR = (NR << 3) + (NR << 1) + (c - 48);
    c=gc();
    }
    return NR;
    }
inline ll inl()
    {
    ll NR=0;
    char c=gc();
    while( c < 48 || c > 57 ){c=gc();}
    while(c>47 && c< 58)
    {
    NR = (NR << 3) + (NR << 1) + (c - 48);
    c=gc();
    }
    return NR;
    }
inline bool inb()
    {
    char c=gc();
    while( c < 48 || c > 57 ){c=gc();}
    return(c=='0'?0:1);    
}
inline ll modpow(ll base, ll exp, ll modulus) {
  base %= modulus;
  ll result = 1;
  while (exp) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}
inline ll ModP(ll base, ll exp) {
  base %= MOD;
  ll result = 1;
  while (exp) {
    if (exp & 1) result = (result * base) % MOD;
    base = (base * base) % MOD;
    exp >>= 1;
  }
  return result;
}
inline ll gcd(ll u, ll v)
{
        if (u == v)
        return u;
    if (!u)
        return v;
    if (!v)
        return u;
    if (~u & 1) 
    {
        if (v & 1) 
            return gcd(u >> 1, v);
        else 
            return gcd(u >> 1, v >> 1) << 1;
    }

    if (~v & 1)
        return gcd(u, v >> 1);
    if (u > v)
        return gcd((u - v) >> 1, v);
    return gcd((v - u) >> 1, u);
}

inline ll rev_num(ll n)
    {
    ll r=n%10;
    for(;n/=10;r=r*10+n%10);
    return r;
}
inline string itos(int i)
    {
    string s="",nm="0123456789";
    if(i==0)
        s="0";
    while(i)
        {
        s+=nm[i%10];
        i/=10;
    }
    return s;    
}
inline string revstr (string a)
    {
    string b="";
    int l=a.length();
    while(l--)
        {
        b+=a[l];
    }
    return b;
}
bool pri[pnu]={1,1,0,0};
vl prm;
int pn[nu]={0,0,1};
inline void prime_init()
    {
    ll i,j;
    for(i=3;i*i<pnu;i+=2)
        {
        if(!pri[i])
            {
            for(j=i*i;j<=pnu;j+=2*i)
                {
                pri[j]=1;
            }
        }
    }
}
inline void prime_asgn()
    {
    ll i;
    prm.pb(2);
    for(i=3;i<pnu;i+=2)
        if(!pri[i])
        prm.pb(i);
}
inline void prime_ass()
    {
    int i;
    for(i=3;i<pnu;i++)
        {
        pn[i]=pn[i-1];
        if(i&1)
            {
            if(!pri[i])
                {
                pn[i]++;
            }                
        }
    }
}
inline bool prime_check(ll i)
    {
    if(i==1)
        return 0;
    if(i<4)
        return 1;
    if(i&1)
        {
        if(i<pnu)
            {
            if(!pri[i])
                return 1; 
            else
                return 0;
        }
        else
            {
            int j,x;
            for(j=1;((x=prm[j])*x)<=i;j++)
                {
                if(!(i%x))
                    return 0;                    
            }
            return 1;
        }
    }
    else
        return 0;
}
inline int npf(ll s)
    {
    int j,x;
    int c;
    for(c=j=0;((x=prm[j])*prm[j])<=s;j++)
                {
                if(!(s%x))
                    {
                    c++;
                    while(!(s%x))
                        {
                        s/=x; 
                    }
                }                    
            }
    if(s>1)
        c++;
    return(c);
}
inline int nf(int s)
    {
    if(s==1)
        return 1;
    int j,x,f=1;
    int c=1;
    for(j=0;((x=prm[j])*prm[j])<=s;c=1,j++)
                {
                if(!(s%x))
                    {
                    while(!(s%x))
                        {
                        s/=x;
                        c++;
                    }
                    f=f*c;
                }                    
            }
    if(s>1)
        {
        f=f<<1;        
    }        
    return(f);
}
int nCrModpDP(int n, int r, int p)
{
    int C[r+1];
    //memset(C, 0, sizeof(C));
    C[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = min(i, r); j > 0; j--)
            C[j] = (C[j] + C[j-1])%p;
    }
    return C[r];
}
int nCrModp(int n, int r, int p)
{
   if (r==0)
      return 1;
   int ni = n%p, ri = r%p;
   return (nCrModp(n/p, r/p, p) * nCrModpDP(ni, ri, p)) % p;
}
inline bool subseq(string &sub, string &big,int m, int n)
    {
    int i,j;
    for(i=j=0;i<m && j<n;j++)
        {
        if(sub[i]==big[j])
            i++;
    }
    return(i==m);
}
int main(){
    prime_init();
    prime_ass();
    int t=in(),x;
    while(t--)
        {
        x=in();
        if(pn[x]&1)
            printf("Alice\n");
        else
            printf("Bob\n");
    }
    return 0;
}