



"""simple docstring"""
from __future__ import annotations





def      __magic_name__				(							lowercase ):
   SCREAMING_SNAKE_CASE_: List[Any]     			=len(lowercase )
   # We need to create solution object to save path.
   SCREAMING_SNAKE_CASE_: Optional[Any]     			=[[0 for _ in range(lowercase )] for _ in range(lowercase )]
   SCREAMING_SNAKE_CASE_: List[str]     			=run_maze(lowercase							,			0							,			0							,			lowercase )
   if solved:
      print("""\n""".join(str(lowercase ) for row in solutions ) )
   else:
      print("""No solution exists!""" )
   return solved





def      __magic_name__				(							lowercase							,			lowercase							,			lowercase							,			lowercase ):
   SCREAMING_SNAKE_CASE_: Any     			=len(lowercase )
   # Final check point.
   if i == j == (size - 1):
      SCREAMING_SNAKE_CASE_: Optional[int]     			=1
      return True

   SCREAMING_SNAKE_CASE_: int     			=(not i < 0) and (not j < 0)  # Check lower bounds
   SCREAMING_SNAKE_CASE_: Union[str, Any]     			=(i < size) and (j < size)  # Check upper bounds

   if lower_flag and upper_flag:
      # check for already visited and block points.
      SCREAMING_SNAKE_CASE_: List[str]     			=(not solutions[i][j]) and (not maze[i][j])
      if block_flag:
         # check visited
         SCREAMING_SNAKE_CASE_: str     			=1

         # check for directions
         if (
             run_maze(lowercase							,			i + 1							,			lowercase							,			lowercase )
             or run_maze(lowercase							,			lowercase							,			j + 1							,			lowercase )
             or run_maze(lowercase							,			i - 1							,			lowercase							,			lowercase )
             or run_maze(lowercase							,			lowercase							,			j - 1							,			lowercase )
         ):
            return True

         SCREAMING_SNAKE_CASE_: str     			=0
         return False
   return False


if __name__ == "__main__":
   import doctest

   doctest.testmod()








"""simple docstring"""
from __future__ import annotations





def      __magic_name__				(							lowercase							,			lowercase ):
   SCREAMING_SNAKE_CASE_: List[Any]     			=sorted(numsa + numsa )
   SCREAMING_SNAKE_CASE_			,		SCREAMING_SNAKE_CASE_: Tuple     			=divmod(len(lowercase )							,			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)}""")



