"""simple docstring"""






def   a_						(					lowerCamelCase       ):
				return 1_0 - x * x



def   a_						(					lowerCamelCase					,			lowerCamelCase       ):





				if equation(SCREAMING_SNAKE_CASE__       ) * equation(SCREAMING_SNAKE_CASE__       ) >= 0:
								raise ValueError('Wrong space!'       )

				UpperCAmelCase__             =							a
				while (b - a) >= 0.01:
								# Find middle point
								UpperCAmelCase__             =							(a + b) / 2
								# Check if middle point is root
								if equation(SCREAMING_SNAKE_CASE__       ) == 0.0:
												break
								# Decide the side to repeat the steps
								if equation(SCREAMING_SNAKE_CASE__       ) * equation(SCREAMING_SNAKE_CASE__       ) < 0:
												UpperCAmelCase__             =							c
								else:
												UpperCAmelCase__             =							c
				return c


if __name__ == "__main__":
						import doctest

						doctest.testmod()

						print(bisection(-2, 5))
						print(bisection(0, 6))







'''simple docstring'''


def 			snake_case_   (  SCREAMING_SNAKE_CASE__     ):







				"""simple docstring"""





				_SCREAMING_SNAKE_CASE :       str     		=      0
				for ch in input_str:
								_SCREAMING_SNAKE_CASE :       Optional[Any]     		=      ord(SCREAMING_SNAKE_CASE__     )
								_SCREAMING_SNAKE_CASE :       Union[str, Any]     		=      pow(2							,      SCREAMING_SNAKE_CASE__     )

								# If we already turned on bit for current character's unicode
								if bitmap >> ch_unicode & 1 == 1:
												return False
								bitmap |= ch_bit_index_on
				return True


if __name__ == "__main__":
				import doctest

				doctest.testmod()




