백준 10815번 파이썬

m= int(input())

a=list(map(int,(input().split())))

n=int(input())

b=list(map(int,(input().split())))

a.sort()

def b_s(arr,tar,st,end):

    while st<=end:

        mid = (st+end)//2

        if arr[mid]==tar:

            return mid

        elif arr[mid]>tar:

            end=mid-1

        else:

            st=mid+1

    return None

for i in range(n):

    if b_s(a,b[i],0,m-1)!=None:

        print(1, end=" ")

    else:

        print(0, end=" ")