#include <stdio.h>
#include <stdlib.h>

int num1[100001],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_search(int low,int high, int target) {
    if (low>high) return 0;
    int mid = (low + high)/2;
    if (num1[mid]==target) return 1;
        //찾는수가 더 크면 mid+1 
    else if(num1[mid] < target) return binary_search(mid+1,high,target);
    else if(num1[mid] > target) return binary_search(low,mid-1,target);
}
int main() {
    int n,m,is_in;
    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(num1[0]),compare);
    for(int i=0; i<m; i++) {
        is_in=binary_search(0,n-1,num2[i]);
        printf("%d\n",is_in);
    }
    
    return 0;
}