


'''simple docstring'''






from __future__ import annotations


def    _snake_case  (	A					,       A			)		->       float:
							lowerCAmelCase__			  =      sorted(numsa + numsa			)
							lowerCAmelCase__  ,   lowerCAmelCase__			  =      divmod(len(A			)					,       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       							=				[float(x) for x in input('''Enter the elements of first array: ''').split()]
		__UpperCAmelCase       							=				[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    _snake_case  (	A			)		->       int:
							if n == 1 or not isinstance(A					,       A			):
														return 0
							elif n == 2:
														return 1
							else:
														lowerCAmelCase__			  =      [0, 1]
														for i in range(2					,       n + 1			):
																					sequence.append(sequence[i - 1] + sequence[i - 2]			)

														return sequence[n]


def    _snake_case  (	A			)		->       int:
							lowerCAmelCase__			  =      0
							lowerCAmelCase__			  =      2

							while digits < n:
														index += 1
														lowerCAmelCase__			  =      len(str(fibonacci(A			)			)			)

							return index


def    _snake_case  (	A = 1000			)		->       int:
							return fibonacci_digits_index(A			)


if __name__ == "__main__":
		print(solution(int(str(input()).strip())))