




'''simple docstring'''




def      a_							(      __snake_case							:			Any   )							->						str:



       """simple docstring"""
       lowerCamelCase_							=int(_lowerCAmelCase   )
       if decimal in (0, 1):  # Exit cases for the recursion
              return str(_lowerCAmelCase   )
       lowerCamelCase_							=divmod(_lowerCAmelCase   ,       2   )
       return binary_recursive(_lowerCAmelCase   ) + str(_lowerCAmelCase   )





def      a_							(      __snake_case							:			Union[str, Any]   )							->						str:



       """simple docstring"""
       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()









def 	__UpperCamelCase	(  _lowerCAmelCase		)       ->  list:



    """simple docstring"""






    return [
        txt[:a] + txt[a].upper() + txt[a + 1 :]
        for a in range(len(_lowerCAmelCase		)		)
        if txt[a].isalpha()
    ]


if __name__ == "__main__":
     __import__("""doctest""").testmod()


