
def      UpperCamelCase   (       __lowerCamelCase	:					int							,   __lowerCamelCase	:					int       ):
       if a < 0 or b < 0:
              raise ValueError("the value of both inputs must be positive"       )

       snake_case			:  Optional[int]     							= str(bin(__lowerCamelCase       )       )[2:]  # remove the leading "0b"
       snake_case			:  Union[str, Any]     							= str(bin(__lowerCamelCase       )       )[2:]  # remove the leading "0b"

       snake_case			:  List[str]     							= max(len(__lowerCamelCase       )							,   len(__lowerCamelCase       )       )

       return "0b" + "".join(
           str(int(char_a != char_b       )       )
           for char_a, char_b in zip(a_binary.zfill(__lowerCamelCase       )							,   b_binary.zfill(__lowerCamelCase       )       )       )


if __name__ == "__main__":
   import doctest

   doctest.testmod()







def      UpperCamelCase   (       __lowerCamelCase	:					int = 1							,   __lowerCamelCase	:					int = 1000       ):
       snake_case			:  int     							= 1
       snake_case			:  int     							= 0

       for divide_by_number in range(__lowerCamelCase							,   digit + 1       ):
              snake_case			:  list[int]     							= []
              snake_case			:  Optional[int]     							= numerator
              for _ in range(1							,   digit + 1       ):
                     if now_divide in has_been_divided:
                            if longest_list_length < len(__lowerCamelCase       ):
                                   snake_case			:  List[Any]     							= len(__lowerCamelCase       )
                                   snake_case			:  List[str]     							= divide_by_number
                     else:
                            has_been_divided.append(__lowerCamelCase       )
                            snake_case			:  Any     							= now_divide * 10 % divide_by_number

       return the_digit


# Tests
if __name__ == "__main__":
   import doctest

   doctest.testmod()





