



def 			_lowerCAmelCase       (					__lowerCAmelCase      )   ->					bool:


				"""simple docstring"""

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

				snake_case__	:      List[Any]     		=	sorted(string.lower()      )
				return len(__lowerCAmelCase      ) == len(set(__lowerCAmelCase      )      )


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






from math import ceil, sqrt



def 			_lowerCAmelCase       (					__lowerCAmelCase = 1000000      )   ->					int:


				"""simple docstring"""

				snake_case__	:      Dict     		=	0

				for outer_width in range(3  ,  (limit // 4) + 2      ):
								if outer_width**2 > limit:
												snake_case__	:      Any     		=	max(ceil(sqrt(outer_width**2 - limit      )      )  ,  1      )
								else:
												snake_case__	:      int     		=	1
								if (outer_width - hole_width_lower_bound) % 2:
												hole_width_lower_bound += 1

								answer += (outer_width - hole_width_lower_bound - 2) // 2 + 1

				return answer


if __name__ == "__main__":
				print(f"""{solution() = }""")

