
from __future__ import annotations

def a__    (       A_,     A_					):






  '''simple docstring'''





  __magic_name__				     =       []
  __magic_name__				     =       []
  __magic_name__				     =       0
  __magic_name__				     =       sum(A_					)
  create_state_space_tree(A_,     A_,     A_,     A_,     A_,     A_					)
  return result

def a__    (       A_,     A_,     A_,     A_,     A_,     A_,     ):






  '''simple docstring'''





  if sum(A_					) > max_sum or (remaining_nums_sum + sum(A_					)) < max_sum:
    return
  if sum(A_					) == max_sum:
    result.append(A_					)
    return
  for index in range(A_,     len(A_					)					):
    create_state_space_tree(
        A_,     A_,     index + 1,     [*path, nums[index]],     A_,     remaining_nums_sum - nums[index],     )
__lowerCAmelCase			:     Tuple           =   [3, 34, 4, 12, 5, 2]
__lowerCAmelCase			:     Tuple           =   9
__lowerCAmelCase			:     Optional[int]           =   generate_sum_of_subsets_soln(nums, max_sum)





print(*result)


from maths.prime_check import is_prime





def    __lowercase     (						lowerCamelCase					:     int	):
 if not isinstance(lowerCamelCase  ,  lowerCamelCase	):
  UpperCamelCase_					:						List[str] =					F"Input value of [number={number}] must be an integer"
  raise TypeError(lowerCamelCase	)
 if is_prime(lowerCamelCase	) and is_prime(number + 2	):
  return number + 2
 else:
  return -1


if __name__ == "__main__":
   import doctest

   doctest.testmod()



