#include<stdio.h>
void solve(int, int);
int P;
int main(){
  int n, q, i, j;
  scanf("%d", &n);
  int *A;
  A = (int *)malloc(sizeof(int) * n);
  for(i = 0; i < n; i++)
    scanf("%d", &A[i]);
  scanf("%d", &q);
  int M[q];
  for(i = 0; i < q; i++){
    scanf("%d", &M[i]);
    P = 0;
    for(j = 0; j < n; j++){
      if(A[j] < M[i])
	M[i] - A[j];
      if(!M[i]){
	printf("yes\n");
	break;
      }
    }
    if(j == n)
      printf("no\n");
  }
  free(A);
  return 0;
}