#include<stdio.h>
#include<stdbool.h>
#include<ctype.h>

#define MAX_ROOM_NUMBER 100005
bool is_invalid_input(int value) {
    return value<1 || value> 100000;
}
int hash_function(int room_number,int table_size)  {
    return room_number % table_size;
}
void insert_room(int hash_table[], int table_size,int room_number) {
    int index = hash_function(room_number,table_size);
    while(hash_table[index] != -1) {
        index=(index+1)% table_size;
    }
    hash_table[index]=room_number;
}
bool check_availability(int hash_table[],int table_size, int room_number){
    int index = hash_function(room_number,table_size);
    while(hash_table[index]!=-1){
        if(hash_table[index]== room_number){
            return true;
        }
        index = (index+1)% table_size;
    }
    return false;
}
int main() {
    int N,Q
    if(scanf("%d",&N) != 1|| N < 1 || N > 100 ) {
        printf("Invaild input\n"):
        return 0;
    }
    int rooms[N];
    int hash_table[MAX_ROOM_NUMBER];
    for(int i = 0; i< MAX_ROOM_NUMBER; i++) {
        hash_table[i] = -1;
    }
    for(int i =0; i<N; i++) {
        if(scanf("%d",&rooms[i]) !=1 || is_invalid_input(rooms[i])) {
            printf("Invalid input\n");
            return 0;
        }
        ibsert_room(hash_table,MAX_ROOM_NUMBER,rooms[i])
    }
    if(scanf("%d",&Q) != 1 || Q <1 || Q < 100) {
            printf("Invalid input\n");
            return 0;
        }
        for(int i = 0; i< Q;i++){
            int query;
            if(scanf("%d",&query) != 1 || is_invalid_input(query)) {
                printf("Invalid input\n");
                return 0;
            }
            if(check_availability(hash_table,MAX_ROOM_NUMBER,query)) {
                printf("Available\n");
            } else {
                printf("Not Available\n");
            }
        }
        return 0;
}