

'''simple docstring'''





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

						lowercase :							List[Any]    		=sorted(string.lower()						)
						return len(__magic_name__						) == len(set(__magic_name__						)						)


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

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









def 						a__			(				A__,      A__				):

			def get_matched_characters(A__,      A__				) -> str:
						SCREAMING_SNAKE_CASE_		:     Dict					=					[]
						SCREAMING_SNAKE_CASE_		:     Any					=					min(len(_stra				),      len(_stra				)				) // 2
						for i, l in enumerate(_stra				):
									SCREAMING_SNAKE_CASE_		:     Union[str, Any]					=					int(max(0,      i - limit				)				)
									SCREAMING_SNAKE_CASE_		:     Union[str, Any]					=					int(min(i + limit + 1,      len(_stra				)				)				)
									if l in _stra[left:right]:
												matched.append(A__				)
												SCREAMING_SNAKE_CASE_		:     List[str]					=					F'''{_stra[0:_stra.index(A__				)]} {_stra[_stra.index(A__				) + 1:]}'''

						return "".join(A__				)

			# matching characters
			SCREAMING_SNAKE_CASE_		:     Union[str, Any]					=					get_matched_characters(A__,      A__				)
			SCREAMING_SNAKE_CASE_		:     int					=					get_matched_characters(A__,      A__				)
			SCREAMING_SNAKE_CASE_		:     Any					=					len(A__				)

			# transposition
			SCREAMING_SNAKE_CASE_		:     Optional[int]					=					(
			    len([(ca, ca) for ca, ca in zip(A__,      A__				) if ca != ca]				) // 2
			)

			if not match_count:
						SCREAMING_SNAKE_CASE_		:     Dict					=					0.0
			else:
						SCREAMING_SNAKE_CASE_		:     Optional[Any]					=					(
						    1
						    / 3
						    * (
						        match_count / len(A__				)
						        + match_count / len(A__				)
						        + (match_count - transpositions) / match_count
						    )
						)

			# common prefix up to 4 characters
			SCREAMING_SNAKE_CASE_		:     List[Any]					=					0
			for ca, ca in zip(stra[:4],      stra[:4]				):
						if ca == ca:
									prefix_len += 1
						else:
									break

			return jaro + 0.1 * prefix_len * (1 - jaro)


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				print(jaro_winkler('hello', 'world'))





