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

int arr[100000];
int target[100000];
int n, m;

int bs(int target) {
	int s = 0;
	int e = n - 1;
	int mid;
	while (1) {
		mid = s + e / 2;
		if (target == arr[mid]) return 1;
		if (s >= e) return 0;
		if (target > arr[mid]) s = mid;
		else e = mid;
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	sort(arr, arr + n);
	cin >> m;
	for (int i = 0; i < m; i++) {
		cin >> target[i];
	}
	for (int i = 0; i < m; i++) {
		cout << bs(target[i]) << '\n';
	}
	return 0;
}