#include<stdio.h>
#include<stdlib.h>

#define TABLE_SIZE 100

int hashFuction(int key){
    return key%TABLE_SIZE;
}
void insert(int hashTable[],int key){
    int index=hashFuction(key);
    while(hashTable[index]!=-1){
        index=(index+1)%TABLE_SIZE;
    }
    hashTable[index]=key;
}
  int search(int hashTable[],int key){
      int index=hashFuction(key);
      int start=index;
      while(hashTable[index]!=-1){
          if(hashTable[index]==key)
            return 1;
            index=(index+1)%TABLE_SIZE;
            if(index==start)
            break;
      }
      return 0;
  }
  int main(){
      int N,Q;
      if(scanf("%d",&N)!=1||N<=0){
          printf("Invalid input\n");
          return 0;
      }
      int rooms[N];
      for(int i=0;i<N;i++){
          if(scanf("%d",&rooms[i])!=1||rooms[i]<=0){
              printf("Invalid input\n");
              return 0;
          }
      }
      if(scanf("%d",&Q)!=1||Q<=0){
          printf("Invalid input\n");
          return 0;
      }
      int queries[Q];
      for(int i=0;i<0;i++)
      {
          if(scanf("%d",&queries[i])!=1||queries[i]<=0){
              printf("Ivalid input\n");
              return 0;
          }
      }
      int hashTable[TABLE_SIZE];
      for(int i=0;i<TABLE_SIZE;i++)
         hashTable[i]=-1;
        
        for(int i=0;i<N;i++)
           insert(hashTable,rooms[i]);
           
         for(int i=0;i<Q;i++){
             if(search(hashTable,queries[i]))
             printf("Available\n");
             else
             printf("Not available\n");
             
         }
          
          return 0;
  }          
          
          
          
          
          
          
          
          
          
          
          
          
          
          
          
          












          
          
          
          
  }