"""simple docstring"""
def 				lowerCAmelCase__      (     _UpperCamelCase    :			Optional[int]   )   ->			int:





      """simple docstring"""






      snake_case        =     len(__UpperCamelCase   )
      while cur > 1:
            # Find the maximum number in arr
            snake_case        =     arr.index(max(arr[0:cur]   )   )
            # Reverse from 0 to mi
            snake_case        =     arr[mi::-1] + arr[mi + 1 : len(__UpperCamelCase   )]
            # Reverse whole list
            snake_case        =     arr[cur - 1 :: -1] + arr[cur : len(__UpperCamelCase   )]
            cur -= 1
      return arr


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



"""simple docstring"""
def 				lowerCAmelCase__      (     _UpperCamelCase    :			str   )   ->			bool:





						"""simple docstring"""






						if not all(x.isalpha() for x in string   ):
												raise ValueError('String must only contain alphabetic characters.'   )

						snake_case        =     sorted(string.lower()   )
						return len(_UpperCamelCase   ) == len(set(_UpperCamelCase   )   )


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE__   =					input("Enter a string ").strip()

					SCREAMING_SNAKE_CASE__   =					is_isogram(input_str)
					print(f"""{input_str} is {'an' if isogram else 'not an'} isogram.""")


