#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        
        cin >> n;
int hash[n],l=0,c=0;
        if(n>1)
        {for(int i=2;i<=n;i++)
            {c=0;
           
            for(int j=2;j<=sqrt(i);j++)
                { //cout<<i<<" ";
                if(i%j==0)
                {hash[i]=0;
                c++;} 
                }
            if(c==0)
            {hash[i]=1;
             l++;
            }}}
       else if(n==1)
           {cout<<"Bob"<<endl;
              l=-1; }
      /* for(int i=1;i<=n;i++)
       {cout<<hash[i]<<"  ";}*/
            if(l%2==0&&l>0)
                cout<<"Bob"<<endl;
        else if(l%2==1&&l>0)
            cout<<"Alice"<<endl;
        // your code goes here
    }
    return 0;
}