#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 prime(int p) {
    int i,count=0;
    for(i=2;i<=p/2;i++) {
        if(p%i==0)
            count++;
    }
    return count;
}
int main(){
    int g,c,n,i,count=0;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        c=0,count=0;
        cin >> n;
        // your code goes here
        for(i=2;i<=n/2;i++) {
            if(n%i==0)
                count++;
       }
       if(count==0)
           c++;
        if(c%2==0 || n==1)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}