#include #include #include #include using namespace std; #define ll long long #define REP(i, N) for(int (i)=0; (i)< (N); (i)++) #define pb push_back #define mp make_pair int p[111111]; int G[111111]; int main() { int primes = 0; int n; scanf("%d", &n); int ans = 0; for(int i = 2; i <= 100000; i++) { int q = 0; if(p[i]==0) { for(ll j = ((ll)i)*i; j<= 100000; j+=i) { p[j] = 1; } q = 1; } G[i] = G[i-1]+q; } for(int i = 0; i < n; i++) { int x; scanf("%d", &x); if(G[x]&1) printf("Alice\n"); else printf("Bob\n"); } return 0; }