

from __future__ import annotations





def      snake_case_				(__A					:						Optional[Any]					)      ->     None:
   create_state_space_tree(_UpperCAmelCase ,       [] ,       0 ,       [0 for i in range(len(_UpperCAmelCase					)					)]					)





def      snake_case_				(__A					:						int ,       __A					:						int ,       __A					:						Optional[Any] ,       __A					:						str ,       )      ->     None:


   if index == len(_UpperCAmelCase					):
      print(_UpperCAmelCase					)
      return

   for i in range(len(_UpperCAmelCase					)					):
      if not index_used[i]:
         current_sequence.append(sequence[i]					)
         __lowerCAmelCase    =						True
         create_state_space_tree(_UpperCAmelCase ,       _UpperCAmelCase ,       index + 1 ,       _UpperCAmelCase					)
         current_sequence.pop()
         __lowerCAmelCase    =						False
__UpperCAmelCase								=			[3, 1, 2, 4]
generate_all_permutations(sequence)

__UpperCAmelCase								=			["A", "B", "C"]
generate_all_permutations(sequence_a)





from __future__ import annotations





def      snake_case_				(__A					:						list[float] ,       __A					:						list[float]					)      ->     float:
   __lowerCAmelCase  :      Union[str, Any]    =						sorted(numsa + numsa					)
   __lowerCAmelCase   ,__lowerCAmelCase  :      Optional[int]    =						divmod(len(__A					) ,       2					)
   if mod == 1:
      return all_numbers[div]
   else:
      return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   __UpperCAmelCase								=			[float(x) for x in input("""Enter the elements of first array: """).split()]
   __UpperCAmelCase								=			[float(x) for x in input("""Enter the elements of second array: """).split()]
   print(F'The median of two arrays is: {median_of_two_arrays(array_a, array_a)}')


