#include<stdio.h>

#define SIZE 100 
    int N,Q;
    int hashTable[SIZE];
    int i,j,key,index;
    for(int i=0; i<SIZE; i++)
    hashTable[i]=-1;
    
    scanf("%d",&N);
    if(N<=0){
        printf("Invalid input\n");
        return 0;
    }
    int rooms[100];
    for(int i=0;i<N;i++){
     scanf("%d",&rooms[i]);
     key=rooms[i];
     index=key%SIZE;
     while (hashTable[index]!=-1)
     index=(index + 1)%SIZE;
     hashTable[index]=key;
    }
    scanf("%d",&Q);
    if(Q<=0){
        printf("Invalid input\n");
        return 0;
    }
    int queries[100];
    for(int i=0;i<Q;i++)
     scanf("%d",&queries[i]);
     for(int i=0;i<Q;i++)
     key=queries[i];
     index=key% SIZE;
     j=0;
     int found=0;
     while(hashTable[index]!=-1&& j<SIZE){
         if (hashTable[index]==key){
             found=1;
             break;
     }
     index=(index+1)%SIZE;
     j++;
     }
     if(found)
      printf("Available\n");
     else
       printf("Not Available\n");
    
   return 0;
}