백준 1920

#pragma warning(disable:4996)
#include <cstdio>
#include <algorithm>


#define size 1000001

using namespace std;

int numA,numB;

int A[size];
int B[size];



int main() {


	scanf("%d", &numA);
	for (int i = 0; i < numA; i++) {
		scanf("%d", &A[i]);
	}

	scanf("%d", &numB);
	for (int i = 0; i < numB; i++) {
		scanf("%d", &B[i]);
	}
	
	sort(A, A + numA);

	
	


	for (int i = 0; i < numB; i++) {
		int  start = 0; int end = numA - 1;
		bool cnt = false;

		while (start <= end) {
			int mid = (start + end) / 2;

			if (A[mid] == B[i]) {

				cnt = true;
				break;


			}

			else if (A[mid] < B[i]) {


				start = mid + 1;

			}
			else {
				end = mid - 1;
			}

		}
		if (cnt == true) { printf("1\n"); }
		else
		{
			printf("0\n");
		}
		}
	}