#include<stdio.h>

int main() {
    int N, Q;
    
    if (scanf("%d",&N) != 1 || N < 1 || N > 100) {
        printf("Invalid input");
        return 0;
    }
    
    int hashTable[N];
    for (int i = 0; i < N; i++)
        hashTable[i] = -1;
        
    for (int i = 0; i < N; i++) {
        int room;
        if (scanf("%d", &room) != 1 || room <1|| room > 100000) {
            printf("Invalid input");
            return 0;
        }
        
        int index = room % N;
        int start = index;
        
        while (hashTable[index] != -1) {
            index = (index +1) % N;
            if (index == start) break;
        }
        hashTable(index) = room;
        }
    if (scanf("%d", &Q; i < 1 || Q < 1 || Q > 100 )){
        printf("Invalid input");
        return 0;
    }
    for (int i = 0; i < q; i++) {
        int query;
        if (scanf ("%d", &query) != -1 || query < 1 || qurey > 100000) {
            printf("Invalid input");
            return 0;
        }
        
        int index = query % N;
        int start + index;
        int found = 0;
        
        while (hashTable[index] != -1) {
            if (hashTable[index] == query) {
                found -1;
                break;
            }
            index = (index + 1) % N;
            if (index == start) break;
        }
        if (found)
            printf("Available\n");
        else
            printf("Not Available");
    }
    
    return 0;
}