#include <iostream>
#include <algorithm>
using namespace std;

int cautare (int v[], int st, int dr, int x)
{
    int m;
    if(st<=dr)
    {
        m=(st+dr)/2;
        if(v[m]==x)
            return 1;
        else
            if(x<v[m])
                return cautare(v,st,m-1,x);
            else
                return cautare(v,m+1,dr,x);
    }
    else return 0;
}
int main ()
{
    int n,m,v[1000],y[1000];
    cin>>n;
    for (int i=0; i<n; i++)
    {
        cin>>v[i];
    }
    sort(v,v+n);
    cin>>m;
    for (int i=0; i<m; i++)
    {
        cin>>y[i];
        if(cautare(v,0,n-1,y[i]))
            cout<<"1 ";
        else

            cout<<"0 ";
    }
}