#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
 
	int input_A, input_each_case, suc;
	int input_B;
 
	vector<int> input_case_A;
	vector<int> input_case_B;
 
	cin >> input_A;
 
	for (int i = 0; i < input_A; i++) {
		cin >> input_each_case;
		input_case_A.push_back(input_each_case);
	}
	sort(input_case_A.begin(), input_case_A.end());
 
	cin >> input_B;
 
	for (int i = 0; i < input_B; i++) {
		cin >> input_each_case;
		input_case_B.push_back(input_each_case);
	}
	for (int i = 0; i < input_B; i++) {
		suc = 0;
		int start = 0;
		int end = input_case_A.size() - 1;
		int mid;
		int key = input_case_B[i];
		while (end - start >= 0) {
			mid = (start + end) / 2;    //중앙 값
 
			if (input_case_A[mid] == key) {    //key값을 찾았을때
				suc = 1;
				break;
			}
			else if (input_case_A[mid] > key) {   //key값이 mid의 값보다 작을때 (왼쪽으로)
				end = mid - 1;
			}
			else {  //key값이 mid의 값보다 클때 (오른쪽으로)
				start = mid + 1;
			}
		}
		if (suc == 1) {
			suc = 0;
			cout << "1\n";
		}
		else
			cout << "0\n";
	}
}