#include <stdio.h>
int n,i,res,A[2000];
int solve(int i,int m);
  
int main(){
    scanf("%d",&n);
    int q,m;
    for(i=0;i<n;i++){
      scanf("%d",&A[i]);
    }
    scanf("%d",&q);
    for(i=0;i<q;i++){
      scanf("%d",&m);
      if(1==solve(0,m))printf("yes\n");
      else printf("no\n");
    }
  return 0;
}

int solve(int i,int m){
  if (m==0)return 1;
  if (i>=n)return 0;
    res = solve(i+1,m)|| solve(i + 1, m - A[i]);
    return res;
  }

