from __future__ import annotations




def       __lowerCAmelCase      (						A_   : int						,	A_   : int					)    ->  list[str]:
  if partitions <= 0:
    raise ValueError("partitions must be a positive number!"					)
  if partitions > number_of_bytes:
    raise ValueError("partitions can not > number_of_bytes!"					)
  __UpperCAmelCase						    =       number_of_bytes // partitions
  __UpperCAmelCase						    =       []
  for i in range(A_					):
    __UpperCAmelCase						    =       i * bytes_per_partition + 1
    __UpperCAmelCase						    =       (
        number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
    )
    allocation_list.append(F'''{start_bytes}-{end_bytes}'''					)
  return allocation_list


if __name__ == "__main__":
       import doctest

       doctest.testmod()




def       __lowerCAmelCase      (						A_   : str					)    ->  bool:
  if not all(x.isalpha() for x in string					):
    raise ValueError("String must only contain alphabetic characters."					)

  __UpperCAmelCase						    =       sorted(string.lower()					)
  return len(A_					) == len(set(A_					)					)


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

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



