


def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE      )->						Tuple:




      """simple docstring"""

      stooge(SCREAMING_SNAKE_CASE      ,      0      ,      len(SCREAMING_SNAKE_CASE      ) - 1      )
      return arr






def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE      ,      SCREAMING_SNAKE_CASE      ,      SCREAMING_SNAKE_CASE      )->						List[Any]:




      """simple docstring"""

      if i >= h:
            return

      # If first element is smaller than the last then swap them
      if arr[i] > arr[h]:
            snake_case_ ,					snake_case_ =   arr[h], arr[i]

      # If there are more than 2 elements in the array
      if h - i + 1 > 2:
            snake_case_ =   (int)((h - i + 1) / 3      )

            # Recursively sort first 2/3 elements
            stooge(SCREAMING_SNAKE_CASE      ,      SCREAMING_SNAKE_CASE      ,      (h - t)      )

            # Recursively sort last 2/3 elements
            stooge(SCREAMING_SNAKE_CASE      ,      i + t      ,      (SCREAMING_SNAKE_CASE)      )

            # Recursively sort first 2/3 elements
            stooge(SCREAMING_SNAKE_CASE      ,      SCREAMING_SNAKE_CASE      ,      (h - t)      )


if __name__ == "__main__":
   UpperCAmelCase    =					input("""Enter numbers separated by a comma:\n""").strip()
   UpperCAmelCase    =					[int(item) for item in user_input.split(""",""")]
   print(stooge_sort(unsorted))



def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE = 3      ,      SCREAMING_SNAKE_CASE = 7      ,      SCREAMING_SNAKE_CASE = 100_0000      )->						int:




      """simple docstring"""

      snake_case_ =   0
      snake_case_ =   1

      for current_denominator in range(1      ,      limit + 1      ):
            snake_case_ =   current_denominator * numerator // denominator
            if current_denominator % denominator == 0:
                  current_numerator -= 1
            if current_numerator * max_denominator > current_denominator * max_numerator:
                  snake_case_ =   current_numerator
                  snake_case_ =   current_denominator
      return max_numerator


if __name__ == "__main__":
   print(solution(numerator=3, denominator=7, limit=100_0000))