#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 p;
        if(n==1)
            p=0;
        
        else
       { p=n-1;
        // your code goes here
        for(int i=2;i<=n;i++)
            {
            for(int j=2;j<=i;j++)
                if((i%j==0)&&(j!=i))
                {p--;break;
                }
        }
        
        if(p%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
        
    }
        if(p==0)
            cout<<"Bob"<<endl;
    }
    return 0;
}