#include <stdio.h>
#define N 20
#define Q 200

int solve(int[],int,int);

int main(void){

  int A[N];
  int M[Q];
  int n,q,i;
  int check;

  scanf("%d",&n);
  for(i=0;i<n;i++)
    scanf("%d",&A[i]);

  scanf("%d",&q);
  for(i=0;i<q;i++)
    scanf("%d",&M[i]);

  for(i=0;i<q;i++){
    check = solve(A,M[i],n);
    if(check == 1)
      printf("yes\n");
    else
      printf("no\n");
  }

  return 0;
}

int solve(int A[],int sum,int n){

  int i,j;
  int flag=0;
  int check;

  for(i=0;i<n;i++){
    for(j=0;j<n;j++){
      if(i != j){
	if(sum == A[i]){
	  flag = 1;
	  break;
	}

	check = A[i] + A[j];
	if(sum == check){
	  flag =1;
	  break;
	}
      }
    }
  }	
  return flag;
}