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

int n, m, dt;
int arr[500001];

int main() {
	scanf("%d", &n);

	for (int i = 0; i < n; i++)
		scanf("%d", &arr[i]);

	scanf("%d", &m);

	sort(arr, arr + n);

	for (int i = 0; i < m; i++) {
		scanf("%d", &dt);
		printf("%d ", binary_search(arr, arr + n, dt));
	}

	printf("\n");

	return 0;
}