//
//  main.cpp
//  codeforces
//
//  Created by Yi Xu on 11/24/16.
//  Copyright © 2016 Yi Xu. All rights reserved.
//

#include <stdio.h>
#include <iostream>
#include <sstream>
#include <ios>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cctype>
using namespace std;
#define XINF INT_MAX
#define INF 0x3FFFFFFF
#define mp(X,Y) make_pair(X,Y)
#define pb(X) push_back(X)
#define rep(X,N) for(int X=0;X<N;X++)
#define rep2(X,L,R) for(int X=L;X<=R;X++)
#define dep(X,R,L) for(int X=R;X>=L;X--)
#define clr(A,X) memset(A,X,sizeof(A))
#define IT iterator
#define ALL(X) (X).begin(),(X).end()
#define PQ std::priority_queue
typedef long long ll;
typedef  unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<PII> VII;
typedef vector<int> VI;
int prime[100010];
int dp[100010];
int main() {
    ios::sync_with_stdio(0);
    prime[0] = prime[1] = 1;
    for(int i = 2; i < 100001; i ++){
        if(prime[i])continue;
        for(int j = i + i; j < 100001;j+=i){
            prime[j] = 1;
        }
    }
    for(int i = 1 ; i < 100001;i ++){
        dp[i] = (1 - prime[i]) + dp[i - 1];
    }
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        if(dp[n] & 1)cout << "Alice" << endl;
        else cout << "Bob" << endl;
    }

    
    
    
    return 0;
}