

def 			lowerCamelCase__			(       _a):
	SCREAMING_SNAKE_CASE :   Optional[int]					  =							int(_SCREAMING_SNAKE_CASE)
	if decimal in (0, 1):  # Exit cases for the recursion
		return str(_SCREAMING_SNAKE_CASE)
	SCREAMING_SNAKE_CASE  ,SCREAMING_SNAKE_CASE :   str					  =							divmod(_SCREAMING_SNAKE_CASE				,      2)
	return binary_recursive(_SCREAMING_SNAKE_CASE) + str(_SCREAMING_SNAKE_CASE)

def 			lowerCamelCase__			(       _a):
	SCREAMING_SNAKE_CASE :   Tuple					  =							str(_SCREAMING_SNAKE_CASE).strip()
	if not number:
		raise ValueError("No input value was provided")
	SCREAMING_SNAKE_CASE :   Optional[Any]					  =							"-" if number.startswith("-") else ""
	SCREAMING_SNAKE_CASE :   Union[str, Any]					  =							number.lstrip("-")
	if not number.isnumeric():
		raise ValueError("Input value is not an integer")
	return f"{negative}0b{binary_recursive(int(_SCREAMING_SNAKE_CASE))}"


if __name__ == "__main__":
			from doctest import testmod

			testmod()






def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				)							-> float:




    """simple docstring"""




    return price * (1 + tax_rate)


if __name__ == "__main__":
 print(f"{price_plus_tax(100, 0.2_5) = }")
 print(f"{price_plus_tax(1_2_5.5_0, 0.0_5) = }")





