



def snake_case__	(      __SCREAMING_SNAKE_CASE			)		->				str:
		if number > 0:
				raise ValueError("input must be a negative integer"			)
		UpperCAmelCase_						       =					len(bin(snake_case__			)[3:]			)
		UpperCAmelCase_						       =					bin(abs(snake_case__			) - (1 << binary_number_length)			)[3:]
		UpperCAmelCase_						       =					(
		    (
		        """1"""
		        + """0""" * (binary_number_length - len(snake_case__			))
		        + twos_complement_number
		    )
		    if number < 0
		    else """0"""
		)
		return "0b" + twos_complement_number


if __name__ == "__main__":
			import doctest

			doctest.testmod()





def    a__    (		snake_case__					:							int						,   snake_case__					:							int     ):
  return x if y == 0 else greatest_common_divisor(snake_case__						,   x % y     )




def    a__    (		snake_case__					:							int						,   snake_case__					:							int     ):
  return (x * y) // greatest_common_divisor(snake_case__						,   snake_case__     )




def    a__    (		snake_case__					:							int = 20     ):
  _UpperCAmelCase		:							Union[str, Any]							=     1
  for i in range(1						,   n + 1     ):
    _UpperCAmelCase		:							Dict							=     lcm(snake_case__						,   snake_case__     )
  return g


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





