


"""simple docstring"""



def       lowerCamelCase					(a_						:bytes)     ->							str:
       return "".join([hex(a_)[2:].zfill(2).upper() for byte in list(a_)])






def       lowerCamelCase					(a_						:str)     ->							bytes:
       # Check data validity, following RFC3548
       # https://www.ietf.org/rfc/rfc3548.txt
       if (len(a_) % 2) != 0:
              raise ValueError(
                  '''Base16 encoded data is invalid:
Data does not have an even number of hex digits.''')
       # Check the character set - the standard base16 alphabet
       # is uppercase according to RFC3548 section 6
       if not set(a_) <= set('''0123456789ABCDEF'''):
              raise ValueError(
                  '''Base16 encoded data is invalid:
Data is not uppercase hex or it contains invalid characters.''')
       # For every two hexadecimal digits (= a byte), turn it into an integer.
       # Then, string the result together into bytes, and return it.
       return bytes(int(data[i] + data[i + 1]				,				16) for i in range(0				,				len(a_)				,				2))


if __name__ == "__main__":
 import doctest

 doctest.testmod()





"""simple docstring"""



def       lowerCamelCase					(a_						:int)     ->							str:
       if number > 0:
              raise ValueError('''input must be a negative integer''')
       lowercase		:Any       							=				len(bin(a_)[3:])
       lowercase		:Any       							=				bin(abs(a_) - (1 << binary_number_length))[3:]
       lowercase		:Tuple       							=				(
           (
               '''1'''
               + '''0''' * (binary_number_length - len(a_))
               + twos_complement_number
           )
           if number < 0
           else '''0'''
       )
       return "0b" + twos_complement_number


if __name__ == "__main__":
 import doctest

 doctest.testmod()

