#include<stdio.h>
#define SIZE 10
int hash(int key) {
    return key % SIZE;
}
void insert(int hashTable[],int key) {
    int index = hash(key);
    int i = 0;
    while (hashTable[(index + i) % SIZE] != -1) {
        i++;
    }
    hashTable[(index + i) % SIZE] = key;
}
int search(int hashTable[],int key) {
    int index = hash(key);
    int i = 0;
    while(hashTable[(index + i) % SIZE] ! =-1 && i < SIZE) {
        if (hashTable[(index + i) % SIZE] == key)
        return 1;
        i++;
    }
    return 0;
}
int main () {
    int N,Q,i,room,query;
    int hashTable[SIZE];
    for (i =0; i < SIZE; i++)
    hashTable[i] = -1;
    scanf("%d", &N);
    for (i = 0; i < N; i++) {
        scanf("%d", &room);
        insert(hashTable,room);
    }
    scanf("%d",&Q);
    for (i =0; i < 0; i++) {
        scanf("%d",&query);
        if(search(hashTable,query))
        printf("Available\n");
        else
        printf("Not Available");
    }
    return 0;
}