#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#define MAX 200
int hashFunction(int key, int size) {
    return key % size;
}
int c(char *str) {
    if(*str == '\0') return 0;
    for (int i = 0; str[i] != '\0'; i++) {
        if (!isdigit(str[i]))
            return 0;
    }
    return 1;
}
int main() {
    int N, Q;
    char buffer[1000];
    if (scanf("%s", buffer) != 1 || !isValidInteger(buffer)) {
        printf("Invalid input");
        return 0;
    }
    N = atoi(buffer);
    if (N < 1 || N > 100) {
        printf("Invalid input");
        return 0;
    }
    int hashTable[MAX];
    for (int i = 0; i < MAX; i++) hashTable[i] = -1;
    for (int i = 0; i < N; i++) {
        if (scanf("%s", buffer) != 1 || !isValidInteger(buffer)) {
            printf("Invalid input");
            return 0;
        }
        int room = atoi(buffer);
        if (room < 1 || room > 100000) {
            printf("Invalid input");
            return 0;
        }
        int index = hashFunction(room, MAX);
        while (hashTable[index] != -1) {
            index = (index + 1) % MAX;
        }
        hashTable[index] = room;
    }
    if (scanf("%s", buffer) != 1 || !isValidInteger(buffer)) {
        printf("Invalid input");
        return 0;
    }
    Q = atoi(buffer);
    if (Q < 1 || Q > 100) {
        printf("Invalid input");
        return 0;
    }
    for (int i = 0; i < Q; i++) {
        if (scanf("%s", buffer) != 1 || !isValidInteger(buffer)) {
            printf("Invalid input");
            return 0;
        }
        int queryRoom = atoi(buffer);
        if (queryRoom < 1 || queryRoom > 100000) {
            printf("Invalid input");
            return 0;
        }
        int index = hashFuntion(queryRoom, MAX);
        int found = 0, count = 0;
        while (hashTable[index] != -1 && count < MAX) {
            if (hashTable[index] == queryRoom) {
                found = 1;
                break;
            }
            index = (index + 1) % MAX;
            court++;
        }
        if (found)
            printf("Available\n");
        else
            printf("Not Available\n");
    }
    return 0;
}