


'''simple docstring'''






def A_       (					__SCREAMING_SNAKE_CASE			:       Optional[Any]							)  ->	Optional[Any]:
					__SCREAMING_SNAKE_CASE       :				Any       =			len(lowerCAmelCase_							)
					while cur > 1:
										# Find the maximum number in arr
										__SCREAMING_SNAKE_CASE       :				Union[str, Any]       =			arr.index(max(arr[0:cur]							)							)
										# Reverse from 0 to mi
										__SCREAMING_SNAKE_CASE       :				Optional[int]       =			arr[mi::-1] + arr[mi + 1 : len(lowerCAmelCase_							)]
										# Reverse whole list
										__SCREAMING_SNAKE_CASE       :				Optional[int]       =			arr[cur - 1 :: -1] + arr[cur : len(lowerCAmelCase_							)]
										cur -= 1
					return arr


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







'''simple docstring'''

def 	__lowerCamelCase	( lowerCAmelCase_    )     -> bool:
		if not all(x.isalpha() for x in string    ):
				raise ValueError('String must only contain alphabetic characters.'    )

		_a	: Tuple								=				sorted(string.lower()    )
		return len(lowerCAmelCase_    ) == len(set(lowerCAmelCase_    )    )


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

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




