#include <stdio.h> int n; int binarySearch(int a[],long key) { int left = 0; int right = n; while(left<=right) { int mid = (left+right)/2; if(a[mid]==key) { return mid; } else if(a[mid]<key) { left = mid+1; } else { right = mid - 1; } } return -1; } int main() { int array[10001]; int i; int m; long q; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&array[i]); scanf("%d",&m); while(m--) { scanf("%ld",&q); if(binarySearch(array,q)>=0) printf("Yes\n"); else printf("No\n"); } return 0; }
