

"""simple docstring"""



def 			_snake_case  (     UpperCAmelCase_	:       Tuple      ):
     A__				      =	1.3
     A__				      =	len(lowerCamelCase_      )
     A__				      =	False

     while not completed:
          # Update the gap value for a next comb
          A__				      =	int(gap / shrink_factor      )
          if gap <= 1:
               A__				      =	True

          A__				      =	0
          while index + gap < len(lowerCamelCase_      ):
               if data[index] > data[index + gap]:
                    # Swap values
                    A__      ,					A__				      =	data[index + gap], data[index]
                    A__				      =	False
               index += 1

     return data


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 SCREAMING_SNAKE_CASE_       :						List[Any]					=    input('Enter numbers separated by a comma:\n').strip()
 SCREAMING_SNAKE_CASE_       :						Dict					=    [int(item) for item in user_input.split(',')]
 print(comb_sort(unsorted))







def  UpperCAmelCase__(    lowerCamelCase_	):



			"""simple docstring"""





			_snake_case														=   len(lowerCamelCase_	)
			_snake_case														=   [0] * length
			_snake_case														=   [[False for i in range(lowerCamelCase_	)] for j in range(lowerCamelCase_	)]
			for i, c in enumerate(lowerCamelCase_	):
						_snake_case														=   i
						for j in range(i + 1	):
									if c == string[j] and (i - j < 2 or is_palindromic[j + 1][i - 1]):
												_snake_case														=   True
												_snake_case														=   min(lowerCamelCase_				,						0 if j == 0 else (cut[j - 1] + 1)	)
						_snake_case														=   mincut
			return cut[length - 1]


if __name__ == "__main__":
			_SCREAMING_SNAKE_CASE:    Dict     						=							input('''Enter the string: ''').strip()
			_SCREAMING_SNAKE_CASE:    str     						=							find_minimum_partitions(s)
			print(F"Minimum number of partitions required for the '{s}' is {ans}")

