
from __future__ import annotations



def        UpperCamelCase    (							lowerCAmelCase__ ,			lowerCAmelCase__		):
					'''simple docstring'''
					lowercase							=						sorted(numsa + numsa		)
					lowercase	,						lowercase							=						divmod(len(lowerCAmelCase__		) ,			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()
							lowercase__		:List[Any]   =    [float(x) for x in input("Enter the elements of first array: ").split()]
							lowercase__		:List[str]   =    [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)}')






def   lowerCAmelCase_						(					_snake_case      :  str      ,   _snake_case      :  str   )				->		bool:







	'''simple docstring'''


	__magic_name__		:		Union[str, Any]	   =     len(_snake_case   ) + 1
	__magic_name__		:		List[str]	   =     len(_snake_case   ) + 1

	# dp is a 2d matrix where dp[i][j] denotes whether prefix string of
	# length i of input_string matches with prefix string of length j of
	# given pattern.
	# "dp" stands for dynamic programming.
	__magic_name__		:		str	   =     [[0 for i in range(_snake_case   )] for j in range(_snake_case   )]

	# since string of zero length match pattern of zero length
	__magic_name__		:		Optional[int]	   =     1

	# since pattern of zero length will never match with string of non-zero length
	for i in range(1      ,   _snake_case   ):
		__magic_name__		:		Optional[int]	   =     0

	# since string of zero length will match with pattern where there
	# is at least one * alternatively
	for j in range(1      ,   _snake_case   ):
		__magic_name__		:		Union[str, Any]	   =     dp[0][j - 2] if pattern[j - 1] == "*" else 0

	# now using bottom-up approach to find for all remaining lengths
	for i in range(1      ,   _snake_case   ):
		for j in range(1      ,   _snake_case   ):
			if input_string[i - 1] == pattern[j - 1] or pattern[j - 1] == ".":
				__magic_name__		:		Optional[int]	   =     dp[i - 1][j - 1]

			elif pattern[j - 1] == "*":
				if dp[i][j - 2] == 1:
					__magic_name__		:		Optional[Any]	   =     1
				elif pattern[j - 2] in (input_string[i - 1], "."):
					__magic_name__		:		List[Any]	   =     dp[i - 1][j]
				else:
					__magic_name__		:		Union[str, Any]	   =     0
			else:
				__magic_name__		:		Dict	   =     0

	return bool(dp[-1][-1]   )


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				# inputing the strings
				# input_string = input("input a string :")
				# pattern = input("input a pattern :")

				snake_case :		Optional[Any]							      =  "aab"
				snake_case :		List[str]							      =  "c*a*b"

				# using function to check whether given string matches the given pattern
				if match_pattern(input_string, pattern):
								print(F"{input_string} matches the given pattern {pattern}")
				else:
								print(F"{input_string} does not match with the given pattern {pattern}")
