




'''simple docstring'''


def 						lowerCamelCase__   (				a							):
						__snake_case						 =   len(a							)
						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(a							)]
												# Reverse whole list
												__snake_case						 =   arr[cur - 1 :: -1] + arr[cur : len(a							)]
												cur -= 1
						return arr


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







'''simple docstring'''


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

						__snake_case						 =   sorted(string.lower()							)
						return len(a							) == len(set(a							)							)


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

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

