





"""simple docstring"""
from __future__ import annotations



def      __lowerCamelCase   (							a_     :		list[float] ,   a_     :		list[float]							)			->      float:
      __SCREAMING_SNAKE_CASE   :Any						=  sorted(numsa + numsa							)
      __SCREAMING_SNAKE_CASE				,__SCREAMING_SNAKE_CASE   :str						=  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()
  lowerCamelCase_								=		[float(x) for x in input("Enter the elements of first array: ").split()]
  lowerCamelCase_								=		[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   (							a_     :		int ,   a_     :		str							)			->      Optional[int]:
      __SCREAMING_SNAKE_CASE   :Optional[int]						=  [1]
      for i in range(2 ,   a_							):
            factorials.append(factorials[-1] * i							)
      assert 0 <= k < factorials[-1] * n, "k out of bounds"

      __SCREAMING_SNAKE_CASE   :List[str]						=  []
      __SCREAMING_SNAKE_CASE   :Optional[Any]						=  list(range(a_							)							)

      # Find permutation
      while factorials:
            __SCREAMING_SNAKE_CASE   :Optional[int]						=  factorials.pop()
            __SCREAMING_SNAKE_CASE				,__SCREAMING_SNAKE_CASE   :Dict						=  divmod(a_ ,   a_							)
            permutation.append(elements[number]							)
            elements.remove(elements[number]							)
      permutation.append(elements[0]							)

      return permutation


if __name__ == "__main__":
  import doctest

  doctest.testmod()