




from __future__ import annotations




def 		lowerCAmelCase_ (						lowerCamelCase						,  lowerCamelCase ):
				__magic_name__						:						Tuple										=sorted(numsa + numsa )
				__magic_name__					,			__magic_name__						:						Optional[Any]										=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()
							UpperCAmelCase_		:					Union[str, Any]          =  [float(x) for x in input("Enter the elements of first array: ").split()]
							UpperCAmelCase_		:					Dict          =  [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)}""")








"""simple docstring"""


def    _lowerCamelCase   (     lowerCamelCase__	:							Optional[Any]  ):
 lowercase__       :       List[str]				=						len(lowerCamelCase__  )
 lowercase__       :       Optional[int]				=						sum(lowerCamelCase__  )

 lowercase__       :       Optional[int]				=						[[False for x in range(s + 1  )] for y in range(n + 1  )]

 for i in range(1       ,		n + 1  ):
  lowercase__       :       int				=						True

 for i in range(1       ,		s + 1  ):
  lowercase__       :       int				=						False

 for i in range(1       ,		n + 1  ):
  for j in range(1       ,		s + 1  ):
   lowercase__       :       Optional[Any]				=						dp[i][j - 1]

   if arr[i - 1] <= j:
    lowercase__       :       int				=						dp[i][j] or dp[i - 1][j - arr[i - 1]]

 for j in range(int(s / 2  )       ,		-1       ,		-1  ):
  if dp[n][j] is True:
   lowercase__       :       List[Any]				=						s - 2 * j
   break

 return diff