



def 	lowerCamelCase_   (  _a    :		Any  ):



    '''simple docstring'''




    if not numbers:
        return 0

    if not isinstance(SCREAMING_SNAKE_CASE__					,						(list, tuple)  ) or not all(
        isinstance(SCREAMING_SNAKE_CASE__					,						SCREAMING_SNAKE_CASE__  ) for number in numbers  ):
        raise ValueError("""numbers must be an iterable of integers"""  )

    UpperCAmelCase_			:    Dict   						= numbers[0]

    for i in range(1					,						len(SCREAMING_SNAKE_CASE__  )  ):
        # update the maximum and minimum subarray products
        UpperCAmelCase_			:    str   						= numbers[i]
        if number < 0:
            UpperCAmelCase_						,      UpperCAmelCase_			:    Tuple   						= min_till_now, max_till_now
        UpperCAmelCase_			:    str   						= max(SCREAMING_SNAKE_CASE__					,						max_till_now * number  )
        UpperCAmelCase_			:    Dict   						= min(SCREAMING_SNAKE_CASE__					,						min_till_now * number  )

        # update the maximum product found till now
        UpperCAmelCase_			:    Any   						= max(SCREAMING_SNAKE_CASE__					,						SCREAMING_SNAKE_CASE__  )

    return max_prod



from __future__ import annotations


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__       ):
						snake_case_   =	len(SCREAMING_SNAKE_CASE__       )
						# We need to create solution object to save path.
						snake_case_   =	[[0 for _ in range(SCREAMING_SNAKE_CASE__       )] for _ in range(SCREAMING_SNAKE_CASE__       )]
						snake_case_   =	run_maze(SCREAMING_SNAKE_CASE__  ,		0  ,		0  ,		SCREAMING_SNAKE_CASE__       )
						if solved:
												print('''\n'''.join(str(SCREAMING_SNAKE_CASE__       ) for row in solutions       )       )
						else:
												print('''No solution exists!'''       )
						return solved


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__  ,		SCREAMING_SNAKE_CASE__  ,		SCREAMING_SNAKE_CASE__  ,		SCREAMING_SNAKE_CASE__       ):
						snake_case_   =	len(SCREAMING_SNAKE_CASE__       )
						# Final check point.
						if i == j == (size - 1):
												snake_case_   =	1
												return True

						snake_case_   =	(not i < 0) and (not j < 0)  # Check lower bounds
						snake_case_   =	(i < size) and (j < size)  # Check upper bounds

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

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

																		snake_case_   =	0
																		return False
						return False


if __name__ == "__main__":
					import doctest

					doctest.testmod()