A number card is a card with a single integer written on it. Sanggeun has N number cards. Given M integers, write a program that decides for each of them whether Sanggeun has a card with that number written on it.
The first line contains N, the number of cards Sanggeun has (1 ≤ N ≤ 500,000). The second line contains the N integers written on those cards, separated by spaces. Each of these integers is at least -10,000,000 and at most 10,000,000, and no two cards carry the same number.
The third line contains M (1 ≤ M ≤ 500,000). The fourth line contains the M integers to check, separated by spaces. These integers are also at least -10,000,000 and at most 10,000,000.
On the first line, process the M given integers in input order and print 1 if Sanggeun has a card with that number written on it and 0 otherwise, separating the values with a single space.