def       __lowerCAmelCase      (						A_   : list[int]						,	A_   : list[int]					)    ->  Optional[Any]:
  __UpperCAmelCase						    =       len(A_					)
  print("The following activities are selected:"					)

  # The first activity is always selected
  __UpperCAmelCase						    =       0
  print(A_						,	end=","					)

  # Consider rest of the activities
  for j in range(A_					):
    # If this activity has start time greater than
    # or equal to the finish time of previously
    # selected activity, then select it
    if start[j] >= finish[i]:
      print(A_						,	end=","					)
      __UpperCAmelCase						    =       j


if __name__ == "__main__":
       import doctest

       doctest.testmod()

       __snake_case							=      [1, 3, 0, 5, 8, 5]
       __snake_case							=      [2, 4, 6, 7, 9, 9]
       print_max_activities(start, finish)




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.")



