#include <iostream>
#include <string>
#include <map>
#include <cstdio>
#include <algorithm>
using namespace std;
map<int,int> ma;
int main() {
int n,m;
scanf("%d",&n);
int a[n];
int i;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
ma[a[i]]=i;
}
scanf("%d",&m);
int b[m];
for(i=0;i<m;i++){
scanf("%d",&b[i]);
if(ma.find(b[i])!=ma.end())
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
if(m.find(target)!=m.end())
printf("查找成功\n");