"""simple docstring"""
# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.





def 				lowerCAmelCase__      (     _UpperCamelCase    :			int   )   ->			Union[str, Any]:





						"""simple docstring"""






						snake_case        =     [False] * len(_UpperCamelCase   )
						snake_case        =     [-1] * len(_UpperCamelCase   )

						def dfs(_UpperCamelCase    :			Optional[Any]	,     _UpperCamelCase    :			str   ):
												snake_case        =     True
												snake_case        =     c
												for u in graph[v]:
																		if not visited[u]:
																								dfs(_UpperCamelCase	,     1 - c   )

						for i in range(len(_UpperCamelCase   )   ):
												if not visited[i]:
																		dfs(_UpperCamelCase	,     0   )

						for i in range(len(_UpperCamelCase   )   ):
												for j in graph[i]:
																		if color[i] == color[j]:
																								return False

						return True


# Adjacency list of graph
SCREAMING_SNAKE_CASE__   =					{0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 4: []}



print(check_bipartite_dfs(graph))



"""simple docstring"""
def 				lowerCAmelCase__      (     _UpperCamelCase    :			str   )   ->			bool:





						"""simple docstring"""






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

						snake_case        =     sorted(string.lower()   )
						return len(_UpperCamelCase   ) == len(set(_UpperCamelCase   )   )


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

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


