#include <stdio.h>
#include <stdlib.h>
void YesOrNo( int * combination, int * array_a , int * array_m, int * ans, int number_a, int number_m )
{
        int sum = 0;
        int i = 0, j = 0;
        for ( i = 0 ; i < number_m ; i++ )
        {
                sum = 0;
                for ( j = 0 ; j < number_a ; j++ )
                {
                        sum = sum + combination[j] * array_a[j];
                }

                if ( sum == array_m[i] )
                {
                        ans[i] = ans[i] + 1;
                        break;
                }
        }
}


void Recycle( int * combination, int * array_a, int * array_m, int * ans, int status, int number_a, int number_m )
{
        if ( status < 0 )
        {
                YesOrNo( combination, array_a, array_m, ans, number_a, number_m );
        }
        else
        {
                combination[status] = 1;
                Recycle( combination, array_a, array_m, ans, status - 1, number_a, number_m );
                combination[status] = 0;
                Recycle( combination, array_a, array_m, ans, status - 1, number_a, number_m );
        }
}

int main()
{
        int number_a, number_m;
        scanf( "%d", &number_a );
        int array_a[number_a];
        int combination[number_a];
        int i = 0;
        for ( i = 0 ; i < number_a ; i++ )
        {
                scanf( "%d", &array_a[i] );
        }

        scanf( "%d", &number_m );
        int array_m[number_m];
        int ans[number_m];
        for ( i = 0 ; i < number_m ; i++ )
        {
                scanf( "%d", &array_m[i] );
                ans[i] = 0;
        }

        Recycle( combination, array_a, array_m, ans, number_a, number_a, number_m );
        for ( i = 0 ; i < number_m ; i++ )
        {
                if ( ans[i] >= 0 )
                {
                        fprintf( stdout, "yes\n" );
                }
                else
                {
                        fprintf( stdout, "no\n" );
                }
        }
        return 0;
}