



lowercase_						=       """Tobias Carryer"""

from time import time
class 			_snake_case     :




    def __init__(  self   :  Optional[int],   __lowercase   :  Dict,   __lowercase   :  Optional[Any],   __lowercase   :  Tuple,   __lowercase   :  Optional[Any]=int(time()  )  ):  # noqa: B008
       lowercase__   					=			multiplier
       lowercase__   					=			increment
       lowercase__   					=			modulo
       lowercase__   					=			seed




    def 							A__ (  self   :  Optional[Any]  ):
       lowercase__   					=			(self.multiplier * self.seed + self.increment) % self.modulo
       return self.seed


if __name__ == "__main__":
       # Show the LCG in action.
       lowercase_						=       LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
       while True:
              print(lcg.next_number())









def __lowerCAmelCase	(       SCREAMING_SNAKE_CASE_					):
			lowercase__   					=			int(SCREAMING_SNAKE_CASE_					)
			if decimal in (0, 1):  # Exit cases for the recursion
						return str(SCREAMING_SNAKE_CASE_					)
			lowercase__					,    lowercase__   					=			divmod(SCREAMING_SNAKE_CASE_  ,					2					)
			return binary_recursive(SCREAMING_SNAKE_CASE_					) + str(SCREAMING_SNAKE_CASE_					)



def __lowerCAmelCase	(       SCREAMING_SNAKE_CASE_					):
			lowercase__   					=			str(SCREAMING_SNAKE_CASE_					).strip()
			if not number:
						raise ValueError("No input value was provided"					)
			lowercase__   					=			"-" if number.startswith("-"					) else ""
			lowercase__   					=			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()




