#include #include #include #include #include #include #include int IsPrime(int n) { int i, number = (int)sqrt(n); for (i = 2; i <= number; i++) if (n % i == 0) return 0; return 1; } void func(int n, int* dp, int max) { for(max++;max <= n;max++) { if(IsPrime(max)) { dp[max] = dp[max - 1] + 1; } else { dp[max] = dp[max - 1]; } } } int main(){ int g; scanf("%d",&g); int *a = (int*)calloc(100001, sizeof(int)); a[0] = 0; a[1] = 0; a[2] = 1; int max = 2; for(int a0 = 0; a0 < g; a0++){ int n; scanf("%d",&n); if(n > max) { func(n, a, max); max = n; } if(a[n] % 2 == 0) printf("Bob\n"); else printf("Alice\n"); } return 0; }