




'''simple docstring'''


def 						lowerCamelCase__   (				a    ,	a							):

						if not (isinstance(a    ,	a							) and isinstance(a    ,	a							)):
												raise ValueError('longest_common_substring() takes two strings for inputs'							)

						__snake_case						 =   len(a							)
						__snake_case						 =   len(a							)

						__snake_case						 =   [[0] * (texta_length + 1) for _ in range(texta_length + 1							)]
						__snake_case						 =   0
						__snake_case						 =   0

						for i in range(1    ,	texta_length + 1							):
												for j in range(1    ,	texta_length + 1							):
																		if texta[i - 1] == texta[j - 1]:
																								__snake_case						 =   1 + dp[i - 1][j - 1]
																								if dp[i][j] > ans_length:
																														__snake_case						 =   i
																														__snake_case						 =   dp[i][j]

						return texta[ans_index - ans_length : ans_index]


if __name__ == "__main__":
	import doctest

	doctest.testmod()







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

