




def        _SCREAMING_SNAKE_CASE      (		snake_case       )						->				list[int]:
						_UpperCAmelCase      =			[0 for i in range(len(_lowerCAmelCase       )       )]

						# initialize interval's left pointer and right pointer
						_UpperCAmelCase      =			0, 0

						for i in range(1			,     len(_lowerCAmelCase       )       ):
												# case when current index is inside the interval
												if i <= right_pointer:
																		_UpperCAmelCase      =			min(right_pointer - i + 1			,     z_result[i - left_pointer]       )
																		_UpperCAmelCase      =			min_edge

												while go_next(_lowerCAmelCase			,     _lowerCAmelCase			,     _lowerCAmelCase       ):
																		z_result[i] += 1

												# if new index's result gives us more right interval,
												# we've to update left_pointer and right_pointer
												if i + z_result[i] - 1 > right_pointer:
																		_UpperCAmelCase      =			i, i + z_result[i] - 1

						return z_result




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case			,     snake_case       )						->				bool:
						return i + z_result[i] < len(_lowerCAmelCase       ) and s[z_result[i]] == s[i + z_result[i]]




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				int:
						_UpperCAmelCase      =			0
						# concatenate 'pattern' and 'input_str' and call z_function
						# with concatenated string
						_UpperCAmelCase      =			z_function(pattern + input_str       )

						for val in z_result:
												# if value is greater then length of the pattern string
												# that means this index is starting position of substring
												# which is equal to pattern string
												if val >= len(_lowerCAmelCase       ):
																		answer += 1

						return answer


if __name__ == "__main__":
				import doctest

				doctest.testmod()





from __future__ import annotations




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				float:
						_UpperCAmelCase      =			sorted(numsa + numsa       )
						_UpperCAmelCase    ,					_UpperCAmelCase      =			divmod(len(snake_case       )			,     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()
				a													=			[float(x) for x in input("Enter the elements of first array: ").split()]
				a													=			[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)}')