#include <iostream>
#include <algorithm>
using namespace std;
#define MAX_N 100000
int n, m, input;
int num[MAX_N];
bool find_m(int start, int end) {
int center = (end + start) / 2;
//printf("start : %d , end : %d, center : %d\n", start, end, center);
if (input == num[center])
return true;
else if (end == start)
return false;
else if (input < num[center])
return find_m(start, center - 1);
else if (input > num[center])
return find_m(center + 1, end);
}
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num[i];
}
sort(num, num + n);
cin >> m;
for (int i = 0; i < m; i++) {
cin >> input;
if (find_m(0, n - 1))
cout << 1 << '\n';
else
cout << 0 << '\n';
}
}
/*
0 1 2 3 4 5 6 7 8 9
c
0 1 2 3 5 6 7 8 9
c c
5 6 8 9
c c
*/
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKI2RlZmluZSBNQVhfTiAxMDAwMDAKaW50IG4sIG0sIGlucHV0OwppbnQgbnVtW01BWF9OXTsKYm9vbCBmaW5kX20oaW50IHN0YXJ0LCBpbnQgZW5kKSB7CglpbnQgY2VudGVyID0gKGVuZCArIHN0YXJ0KSAvIDI7CgkvL3ByaW50Zigic3RhcnQgOiAlZCAsIGVuZCA6ICVkLCBjZW50ZXIgOiAlZFxuIiwgc3RhcnQsIGVuZCwgY2VudGVyKTsKCWlmIChpbnB1dCA9PSBudW1bY2VudGVyXSkKCQlyZXR1cm4gdHJ1ZTsKCWVsc2UgaWYgKGVuZCA9PSBzdGFydCkKCQlyZXR1cm4gZmFsc2U7CgllbHNlIGlmIChpbnB1dCA8IG51bVtjZW50ZXJdKQoJCXJldHVybiBmaW5kX20oc3RhcnQsIGNlbnRlciAtIDEpOwoJZWxzZSBpZiAoaW5wdXQgPiBudW1bY2VudGVyXSkKCQlyZXR1cm4gZmluZF9tKGNlbnRlciArIDEsIGVuZCk7Cn0KCmludCBtYWluKCkgewoJY2luLnRpZShOVUxMKTsKCWlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwoKCWNpbiA+PiBuOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKCQljaW4gPj4gbnVtW2ldOwoJfQoKCXNvcnQobnVtLCBudW0gKyBuKTsKCgljaW4gPj4gbTsKCWZvciAoaW50IGkgPSAwOyBpIDwgbTsgaSsrKSB7CgkJY2luID4+IGlucHV0OwoJCWlmIChmaW5kX20oMCwgbiAtIDEpKQoJCQljb3V0IDw8IDEgPDwgJ1xuJzsKCQllbHNlCgkJCWNvdXQgPDwgMCA8PCAnXG4nOwoJfQp9CgovKgowIDEgMiAzIDQgNSA2IDcgOCA5CiAgICAgICAgYwowIDEgMiAzICAgNSA2IDcgOCA5CiAgYyAgICAgICAgICAgYwogICAgICAgICAgNSA2ICAgOCA5CgkJICBjICAgICBjCiov