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






def 				__lowerCamelCase		(						lowerCAmelCase__     ):
       lowerCAmelCase__					     = str(lowerCAmelCase__     ).strip()
       if not number:
              raise ValueError('No input value was provided'     )
       lowerCAmelCase__					     = '-' if number.startswith('-'     ) else ''
       lowerCAmelCase__					     = number.lstrip('-'     )
       if not number.isnumeric():
              raise ValueError('Input value is not an integer'     )
       return F"""{negative}0b{binary_recursive(int(lowerCAmelCase__     )     )}"""


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

    testmod()

import copy
from dataclasses import dataclass
from pathlib import Path
from typing import Dict, Optional, Union
@dataclass
class     a_			:






 '''simple docstring'''






 UpperCAmelCase_     			= None
 UpperCAmelCase_     			= False
 UpperCAmelCase_     			= False
 UpperCAmelCase_     			= False
 UpperCAmelCase_     			= None
 UpperCAmelCase_     			= None
 UpperCAmelCase_     			= False
 UpperCAmelCase_     			= False
 UpperCAmelCase_     			= False
 UpperCAmelCase_     			= True
 UpperCAmelCase_     			= None
 UpperCAmelCase_     			= 1
 UpperCAmelCase_     			= None
 UpperCAmelCase_     			= False
 UpperCAmelCase_     			= None
 UpperCAmelCase_     			= None




 def 		__snake_case						(      self :  Dict):







        '''simple docstring'''



        return self.__class__(**{k: copy.deepcopy(lowercase__) for k, v in self.__dict__.items()})
