#include <vector>
#include <iostream>
#include <algorithm>


using namespace std;


int main(){
    int n, m, tmp;
    cin >> n;
    vector<int> a;
    vector<int> b;

    for(int i = 0; i < n; ++ i ){
        cin >> tmp;
        a.push_back(tmp);
    }
    sort(a.begin(), a.end());

    cin >> m;

    while(m--){
        cin >> tmp;
        int l = 0, r = a.size() - 1;
        while(l < r){
            int mid = l + r >> 1;
            if(a[mid] >= tmp) r = mid;
            else l = mid + 1;
        }
        if(a[l] == tmp) cout << "YES" << endl;
        else cout << "NO" << endl;
    }


    return 0;
}