

def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE   ):
      '''simple docstring'''







      if len(SCREAMING_SNAKE_CASE   ) < 2:
            return collection

      def circle_sort_util(SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE   ) -> bool:
            A_							       =		False

            if low == high:
                  return swapped

            A_							       =		low
            A_							       =		high

            while left < right:
                  if collection[left] > collection[right]:
                        A_       ,A_							       =		(
                            collection[right],
                            collection[left],
                        )
                        A_							       =		True

                  left += 1
                  right -= 1

            if left == right and collection[left] > collection[right + 1]:
                  A_       ,A_							       =		(
                      collection[right + 1],
                      collection[left],
                  )

                  A_							       =		True

            A_							       =		low + int((high - low) / 2   )
            A_							       =		circle_sort_util(SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE   )
            A_							       =		circle_sort_util(SCREAMING_SNAKE_CASE		,				mid + 1		,				SCREAMING_SNAKE_CASE   )

            return swapped or left_swap or right_swap

      A_							       =		True

      while is_not_sorted is True:
            A_							       =		circle_sort_util(SCREAMING_SNAKE_CASE		,				0		,				len(SCREAMING_SNAKE_CASE   ) - 1   )

      return collection


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








from itertools import product







def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE   ):
      '''simple docstring'''







      A_							       =		sides_number
      A_							       =		max_face_number * dice_number
      A_							       =		[0] * (max_total + 1)

      A_							       =		1
      A_							       =		range(SCREAMING_SNAKE_CASE		,				max_face_number + 1   )
      for dice_numbers in product(SCREAMING_SNAKE_CASE		,				repeat=SCREAMING_SNAKE_CASE   ):
            A_							       =		sum(SCREAMING_SNAKE_CASE   )
            totals_frequencies[total] += 1

      return totals_frequencies







def 							_lowerCamelCase   (			):
      '''simple docstring'''







      A_							       =		total_frequency_distribution(
          sides_number=4		,				dice_number=9   )
      A_							       =		total_frequency_distribution(
          sides_number=6		,				dice_number=6   )

      A_							       =		0
      A_							       =		9
      A_							       =		4 * 9
      A_							       =		6
      for peter_total in range(SCREAMING_SNAKE_CASE		,				max_peter_total + 1   ):
            peter_wins_count += peter_totals_frequencies[peter_total] * sum(
                colin_totals_frequencies[min_colin_total:peter_total]   )

      A_							       =		(4**9) * (6**6)
      A_							       =		peter_wins_count / total_games_number

      A_							       =		round(SCREAMING_SNAKE_CASE		,				ndigits=7   )

      return rounded_peter_win_probability


if __name__ == "__main__":
      print(f'{solution() = }')





