


'''simple docstring'''

def 							__magic_name__(						lowerCamelCase,				lowerCamelCase):
						__lowerCAmelCase							       =				len(snake_case_)
						__lowerCAmelCase							       =				[]
						for i in range(len(snake_case_) - pat_len + 1):
												__lowerCAmelCase							       =				True
												for j in range(snake_case_):
																		if s[i + j] != pattern[j]:
																								__lowerCAmelCase							       =				False
																								break
												if match_found:
																		position.append(snake_case_)
						return position


if __name__ == "__main__":
	assert naive_pattern_search("""ABCDEFG""", """DE""") == [3]
	print(naive_pattern_search("""ABAAABCDBBABCDDEBCABC""", """ABC"""))





'''simple docstring'''

from __future__ import annotations

def 							__magic_name__(						lowerCamelCase,				lowerCamelCase):
						__lowerCAmelCase							       =				sorted(numsa + numsa)
						__lowerCAmelCase       ,					__lowerCAmelCase							       =				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				: int							    =				[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)}""")

