numsrc = int(input())
listsrc = list(map(int, input().split()))
numtar = int(input())
listtar = list(map(int, input().split()))


class Node():
    def __init__(self, data):
        self.data = data
        self.left = self.right = None


class binSearch():
    def __init__(self):
        self.root = None

    def insert(self, data):
        self.root = self._ins_val(self.root, data)

    def _ins_val(self, node, data):
        if node == None:
            node = Node(data)
        else:
            if data <= node.data:
                node.left = self._ins_val(node.left, data)
            else:
                node.right = self._ins_val(node.right, data)
        return node

    def find(self, data):
        return self._find_val(self.root, data)

    def _find_val(self, node, data):
        if node == None:
            return 0
        elif node.data == data:
            return 1  # str(data) + ' is found'
        else:
            if data <= node.data:
                return self._find_val(node.left, data)
            else:
                return self._find_val(node.right, data)


bins = binSearch()
for i in range(numsrc):
    bins.insert(listsrc[i])

for j in range(numtar):
    print(bins.find(listtar[j]))

numsrc = int(input())
listsrc = list(map(int, input().split()))
numtar = int(input())
listtar = list(map(int, input().split()))


for i in range(numtar):
    flag = 0
    for j in range(numsrc):
        if listsrc[j] == listtar[i]:
            print(1)
            flag = 1
    if flag == 0:
        print(0)