

'''simple docstring'''






def 					__lowerCamelCase			(      SCREAMING_SNAKE_CASE_     :	List[Any]  ,  SCREAMING_SNAKE_CASE_     :	List[Any]  ,  SCREAMING_SNAKE_CASE_     :	Tuple  ,  SCREAMING_SNAKE_CASE_     :	Tuple    )							->   List[Any]:
      """simple docstring"""

      if start == end:
            return start if lst[start] > item else start + 1
      if start > end:
            return start

      SCREAMING_SNAKE_CASE_      :			int     =       (start + end) // 2
      if lst[mid] < item:
            return binary_search(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_  ,  mid + 1  ,  SCREAMING_SNAKE_CASE_    )
      elif lst[mid] > item:
            return binary_search(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_  ,  mid - 1    )
      else:
            return mid


def 					__lowerCamelCase			(      SCREAMING_SNAKE_CASE_     :	List[str]    )							->   List[str]:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_      :			List[str]     =       len(SCREAMING_SNAKE_CASE_    )

      for index in range(1  ,  SCREAMING_SNAKE_CASE_    ):
            SCREAMING_SNAKE_CASE_      :			List[Any]     =       lst[index]
            SCREAMING_SNAKE_CASE_      :			List[str]     =       binary_search(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_  ,  0  ,  index - 1    )
            SCREAMING_SNAKE_CASE_      :			Optional[Any]     =       lst[:pos] + [value] + lst[pos:index] + lst[index + 1 :]

      return lst


def 					__lowerCamelCase			(      SCREAMING_SNAKE_CASE_     :	Any  ,  SCREAMING_SNAKE_CASE_     :	str    )							->   Optional[Any]:
      """simple docstring"""

      if not left:
            return right

      if not right:
            return left

      if left[0] < right[0]:
            return [left[0], *merge(left[1:]  ,  SCREAMING_SNAKE_CASE_    )]

      return [right[0], *merge(SCREAMING_SNAKE_CASE_  ,  right[1:]    )]


def 					__lowerCamelCase			(      SCREAMING_SNAKE_CASE_     :	Optional[int]    )							->   Any:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_      :			Any     =       len(SCREAMING_SNAKE_CASE_    )
      SCREAMING_SNAKE_CASE_,						SCREAMING_SNAKE_CASE_      :			Tuple     =       [], []
      SCREAMING_SNAKE_CASE_      :			Optional[int]     =       [lst[0]]
      SCREAMING_SNAKE_CASE_      :			str     =       []
      SCREAMING_SNAKE_CASE_      :			Tuple     =       1
      while i < length:
            if lst[i] < lst[i - 1]:
                  runs.append(SCREAMING_SNAKE_CASE_    )
                  SCREAMING_SNAKE_CASE_      :			Optional[Any]     =       [lst[i]]
            else:
                  new_run.append(lst[i]    )
            i += 1
      runs.append(SCREAMING_SNAKE_CASE_    )

      for run in runs:
            sorted_runs.append(insertion_sort(SCREAMING_SNAKE_CASE_    )    )
      for run in sorted_runs:
            SCREAMING_SNAKE_CASE_      :			List[str]     =       merge(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_    )

      return sorted_array


def 					__lowerCamelCase			(      )							->   Optional[Any]:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_      :			List[str]     =       [5, 9, 1_0, 3, -4, 5, 1_7_8, 9_2, 4_6, -1_8, 0, 7]
      SCREAMING_SNAKE_CASE_      :			Union[str, Any]     =       tim_sort(SCREAMING_SNAKE_CASE_    )
      print(SCREAMING_SNAKE_CASE_    )


if __name__ == "__main__":
      main()








"""simple docstring"""


def SCREAMING_SNAKE_CASE_   (       )->		Tuple:
       _lowerCamelCase    	=					1

       while True:
              if (
                  sorted(str(snake_case		)		)
                  == sorted(str(2 * i		)		)
                  == sorted(str(3 * i		)		)
                  == sorted(str(4 * i		)		)
                  == sorted(str(5 * i		)		)
                  == sorted(str(6 * i		)		)
              ):
                     return i

              i += 1


if __name__ == "__main__":
      print(solution())






