3966. Ardent Butterfly Collector

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define mp make_pair
#define pb push_back

signed main() {
    ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    int n;
    cin >> n;

    vector<int> v(n);

    for(int i=0;i<n;i++)
    {
        cin >> v[i];
    }

    sort(v.begin(),v.end());

    int t;
    cin >> t;

    int L,R;
    int mid;

    int a;

    while(t--)
    {
        cin >> a;
        L = 0, R = n-1;
        while(R-L>1)
        {
            mid = (L+R)/2;
            if(v[mid] > a)
                R = mid;
            else
                L = mid;
        }
        cout << ((v[L] == a || v[R] == a) ? "YES\n" : "NO\n");
    }

    return 0;
}