int main() {
    vector<int>v;
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int cl;
        cin>>cl;
        v.push_back(cl);
    }  
    int test;
    cin>>test;
    sort(v.begin(),v.end());
    for(int i=0;i<test;i++){
        int x;
        cin>>x;
        auto it = lower_bound(v.begin(),v.end(),x);
        if(x == *it)
        cout<<"Yes"<<" "<<(it-v.begin()+1)<<endl;
        else {
         cout<<"No"<<" "<<(it-v.begin()+1)<<endl;
        }
    }
    return 0;
}

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int n, q, y;
    cin >> n;
    vector<int> x(n);
    for(int i =0; i<n; ++i){
        cin >> x[i];
    }
    cin >> q;
    while(q--){
        cin >> y;
        auto ans = lower_bound(x.begin(), x.end(), y);
        if(*ans==y){
            cout << "Yes " << to_string(ans-x.begin()+1) << "\n";
        }
        else{
            cout << "No " << to_string(ans-x.begin()+1) << "\n";            
        }
    } 
    return 0;
}

int main() {
    int N, Q;
    cin >> N;
    vector<int> sorted(N);
    for (int i = 0; i < N; i++) cin >> sorted[i];
    cin >> Q;
    vector<int> query(Q);
    for (int i = 0; i < Q; i++) cin >> query[i];
    for (auto x : query)
    {
        auto result = lower_bound(sorted.begin(),sorted.end(),x);
        if(*result==x) cout<<"Yes "+to_string(result-sorted.begin()+1)<<endl;
        else cout<<"No "+to_string(result-sorted.begin()+1)<<endl;
    }
    return 0;
}