#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; int primeno[1000009]; void sieve(int n) { // Create a boolean array "prime[0..n]" and initialize // all entries it as true. A value in prime[i] will // finally be false if i is Not a prime, else true. bool prime[n+1]; memset(prime, true, sizeof(prime)); for (int p=2; p*p<=n; p++) { // If prime[p] is not changed, then it is a prime if (prime[p] == true) { // Update all multiples of p for (int i=p*2; i<=n; i += p) prime[i] = false; } } memset(primeno,0,sizeof(primeno)); primeno[0]=primeno[1]=0; // Print all prime numbers for (int p=2; p<=n; p++) if (prime[p])primeno[p]=primeno[p-1]+1; else primeno[p]=primeno[p-1]; } int main(){ int g; sieve(100008); cin >> g; for(int a0 = 0; a0 < g; a0++){ int n; cin >> n; // your code goes here if(primeno[n]&1)cout<<"Alice"<