#include <stdio.h>
#include <stdlib.h>
int num1[100001];
int num2[100001];
int compare(const void *a,const void *b){
    int n1=*(int*)a;
    int n2=*(int*)b;
    if(n1>n2) return 1;
    else if (n1<n2) return -1;
    else return 0;;
}

int binary_find(int n, int target) {
    int l=0,r=n-1;
    while(l<=r) {
        int mid=(l+r)/2;
        if(num1[mid]==target)return 1;
            
        if (num1[mid]< target) l=mid+1;
        else if (num1[mid]> target) r=mid-1;
    }
    return 0;
}

int main() {
    
    int n,m;
    scanf("%d",&n);
    for(int i=0; i<n; i++) {
        scanf("%d",&num1[i]);
    }
    scanf("%d",&m);
    for(int i=0; i<m; i++) {
        scanf("%d",&num2[i]);
    }
    qsort(num1,n,sizeof(int),compare);
    for(int i=0; i<m; i++) {
        int is_in=binary_find(n,num2[i]);
        printf("%d\n",is_in);
    }
    return 0;
}