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

#define MAX_SIZE 100

int hash_table[MAX_SIZE];

int hash(int room_number){
    return room_number % MAX_SIZE;
}
void insert(int room_number){
    int index = hash(room_number);
    while(hash_table[index] !=0){
        index=(index + 1) % MAX_SIZE;
    }
    hash_table[index] = room_number;
}
int search(int room_number){
      int index = hash(room_number);
    while(hash_table[index] !=0){
        if(hash_table[index] == room_number){
            return 1;
        }
        index = (index + 1) % MAX_SIZE;
}
return 0;
}
int main(){
    int N,Q;
    if(scanf("%d", &N) !=1 || N <= 0){
     printf("Invalid input");
     return 0;
    }
    for(int i =0; i < N; i++){
        hash_table[i] =0;
    }
    for(int i =0; i<N;i++){
        int room_number;
        if(scanf("%d",&room_number) != 1 || room_number <=0){
            printf("Invalid input");
            return 0;
        }
    }
    insert(room_number);
}
if(scanf("%d",&Q)!= 1 || Q <= 0){
    printf("Invalid input\n");
    return 0;
    }
     for(int i=0; i< Q; i++){
         int query_room;
         if(scanf("%d",&Q) != 1 || Q <= 0){
             printf("Invalid input");
             return 0;
         }
         if(search(query_room)){
             printf("Available\n");
         }else{
           printf("Not Available\n");   
         }
}
return 0;
}