#include<stdio.h>
int a[1000000], b[1000000], n, j;

int  solve(int i, int m){
    if( m == b[j]){
        return 1;
    }
    else if(i >= n){
        return 0;
    }
    return solve(i + 1, m) || solve(i + 1, m + a[i]) ;
}

int main(){
   int d, i, count;
   count = 0;
   
   scanf("%d", &n);
   for (i = 0; i < n; i++){
      scanf("%d", &a[i]);
   }
   scanf("%d", &d);
   for(j = 0; j < d; j++){
      scanf("%d", &b[j]);
      if(solve(0,0))
          printf("yes\n");
      else
          printf("no\n");
   }

        
    
    return 0;
}

