def solve( p, t ):
	global isExist
	global n
	global A
	isExist[ t ] = True
	if p < n:
		solve( p+1, t-A[p] )
		solve( p+1, t )
	else:
		return

isExist = [False]*2001 
n = int( raw_input() )
A = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ]
q = int( raw_input() )
M = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ]
s = sum( A )
solve( 0, s )
for i in range( 0, q ):
	if isExist[ M[i] ]:
		print( "yes" )
	else:
		print( "no" ) def solve( p, t ):
	global isExist
	global n
	global A
	isExist[ t ] = True
	if p < n:
		solve( p+1, t-A[p] )
		solve( p+1, t )
	else:
		return solve global isExist global n global A isExist[ t ] = True isExist[ t ] isExist t True if p < n:
		solve( p+1, t-A[p] )
		solve( p+1, t )
	else:
		return p < n p n solve( p+1, t-A[p] ) solve p+1 p 1 t-A[p] t A[p] A p solve( p+1, t ) solve p+1 p 1 t return p p t t isExist = [False]*2001 isExist [False]*2001 [False] False 2001 n = int( raw_input() ) n int( raw_input() ) int raw_input() raw_input int( val ) for val in raw_input().rstrip().split( ' ' ) for val in raw_input().rstrip().split( ' ' ) val raw_input().rstrip().split( ' ' ) ().rstrip().split ().rstrip() ().rstrip () raw_input rstrip split ' ' for val in raw_input().rstrip().split( ' ' ) int( val ) int val A = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] A [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] q = int( raw_input() ) q int( raw_input() ) int raw_input() raw_input int( val ) for val in raw_input().rstrip().split( ' ' ) for val in raw_input().rstrip().split( ' ' ) val raw_input().rstrip().split( ' ' ) ().rstrip().split ().rstrip() ().rstrip () raw_input rstrip split ' ' for val in raw_input().rstrip().split( ' ' ) int( val ) int val M = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] M [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] s = sum( A ) s sum( A ) sum A solve( 0, s ) solve 0 s for i in range( 0, q ):
	if isExist[ M[i] ]:
		print( "yes" )
	else:
		print( "no" ) i range( 0, q ) range 0 q if isExist[ M[i] ]:
		print( "yes" )
	else:
		print( "no" ) isExist[ M[i] ] isExist M[i] M i print( "yes" ) print "yes" print( "no" ) print "no" A = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] A isExist = [False]*2001 [False]*2001 isExist s = sum( A ) sum( A ) s def solve( p, t ):
	global isExist
	global n
	global A
	isExist[ t ] = True
	if p < n:
		solve( p+1, t-A[p] )
		solve( p+1, t )
	else:
		return def solve( p, t ):
	global isExist
	global n
	global A
	isExist[ t ] = True
	if p < n:
		solve( p+1, t-A[p] )
		solve( p+1, t )
	else:
		return solve q = int( raw_input() ) int( raw_input() ) q M = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] [ int( val ) for val in raw_input().rstrip().split( ' ' ) ] M n = int( raw_input() ) int( raw_input() ) n
def solve( p, t ):
	global isExist
	global n
	global A
	isExist[ t ] = True
	if p < n:
		solve( p+1, t-A[p] )
		solve( p+1, t )
	else:
		return

isExist = [False]*2001 
n = int( raw_input() )
A = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ]
q = int( raw_input() )
M = [ int( val ) for val in raw_input().rstrip().split( ' ' ) ]
s = sum( A )
solve( 0, s )
for i in range( 0, q ):
	if isExist[ M[i] ]:
		print( "yes" )
	else:
		print( "no" )