#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;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGFyclsxMDAwMDBdOwppbnQgdGFyZ2V0WzEwMDAwMF07CmludCBuLCBtOwoKaW50IGJzKGludCB0YXJnZXQpIHsKCWludCBzID0gMDsKCWludCBlID0gbiAtIDE7CglpbnQgbWlkOwoJd2hpbGUgKDEpIHsKCQltaWQgPSBzICsgZSAvIDI7CgkJaWYgKHRhcmdldCA9PSBhcnJbbWlkXSkgcmV0dXJuIDE7CgkJaWYgKHMgPj0gZSkgcmV0dXJuIDA7CgkJaWYgKHRhcmdldCA+IGFyclttaWRdKSBzID0gbWlkOwoJCWVsc2UgZSA9IG1pZDsKCX0KfQoKaW50IG1haW4oKSB7CglzdGQ6Omlvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKCXN0ZDo6Y2luLnRpZShudWxscHRyKTsKCWNpbiA+PiBuOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKCQljaW4gPj4gYXJyW2ldOwoJfQoJc29ydChhcnIsIGFyciArIG4pOwoJY2luID4+IG07Cglmb3IgKGludCBpID0gMDsgaSA8IG07IGkrKykgewoJCWNpbiA+PiB0YXJnZXRbaV07Cgl9Cglmb3IgKGludCBpID0gMDsgaSA8IG07IGkrKykgewoJCWNvdXQgPDwgYnModGFyZ2V0W2ldKSA8PCAnXG4nOwoJfQoJcmV0dXJuIDA7Cn0=