#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>
#define ll long long
using namespace std;
long long p,fix[1000001],n,j;
int main(){
    int m;
    cin>>m;
    for(int i = 0; i < m; i++){
        
        cin>>n;
        p=0;
        for (j=2;j<=n;j++){
            if (fix[j]==0){
                p++;
                for (long long x=j*j;x<=n;x+=j){
                    fix[x]=1;
                }
            }
        }
        if (p%2==1) cout<<"Alice"<<endl;
            else cout<<"Bob"<<endl;
    }
    return 0;


}