'''simple docstring'''

def       __UpperCamelCase	(       UpperCAmelCase					):

 def merge(UpperCAmelCase		,					UpperCAmelCase					) -> list:

  def _merge():
   while left and right:
    yield (left if left[0] <= right[0] else right).pop(0					)
   yield from left
   yield from right

  return list(_merge()					)

 if len(UpperCAmelCase					) <= 1:
  return collection
 lowercase__    :   int						= len(UpperCAmelCase					) // 2
 return merge(merge_sort(collection[:mid]					)		,					merge_sort(collection[mid:]					)					)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  __a:			str	       =       input("""Enter numbers separated by a comma:\n""").strip()
  __a:			Optional[int]	       =       [int(item) for item in user_input.split(""",""")]
  print(*merge_sort(unsorted), sep=""",""")


'''simple docstring'''

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

 lowercase__    :   Tuple						= sorted(string.lower()					)
 return len(UpperCAmelCase					) == len(set(UpperCAmelCase					)					)


if __name__ == "__main__":
  __a:			Union[str, Any]	       =       input("""Enter a string """).strip()

  __a:			Tuple	       =       is_isogram(input_str)
  print(F'{input_str} is {"an" if isogram else "not an"} isogram.')

