


def 		_UpperCAmelCase							(     SCREAMING_SNAKE_CASE__     :   int							):
     if not isinstance(SCREAMING_SNAKE_CASE__     ,	SCREAMING_SNAKE_CASE__							):
          __UpperCamelCase       				=(
              'operation can not be conducted on a object of type '
              F'{type(SCREAMING_SNAKE_CASE__							).__name__}'
          )
          raise TypeError(SCREAMING_SNAKE_CASE__							)
     __UpperCamelCase       				=''
     for _ in range(0     ,	32							):
          bit_string += str(number % 2							)
          __UpperCamelCase       				=number >> 1
     return bit_string

def 		_UpperCAmelCase							(     SCREAMING_SNAKE_CASE__     :   int							):
     if number < 0:
          raise ValueError('the value of input must be positive'							)
     elif isinstance(SCREAMING_SNAKE_CASE__     ,	SCREAMING_SNAKE_CASE__							):
          raise TypeError('Input value must be a \'int\' type'							)
     elif isinstance(SCREAMING_SNAKE_CASE__     ,	SCREAMING_SNAKE_CASE__							):
          raise TypeError('\'<\' not supported between instances of \'str\' and \'int\''							)
     __UpperCamelCase       				=0
     # iterator over [1 to 32],since we are dealing with 32 bit integer
     for _ in range(1     ,	33							):
          # left shift the bits by unity
          __UpperCamelCase       				=result << 1
          # get the end bit
          __UpperCamelCase       				=number % 2
          # right shift the bits by unity
          __UpperCamelCase       				=number >> 1
          # add that bit to our ans
          __UpperCamelCase       				=result | end_bit
     return get_reverse_bit_string(SCREAMING_SNAKE_CASE__							)


if __name__ == "__main__":
   import doctest

   doctest.testmod()









def 		_UpperCAmelCase							(     SCREAMING_SNAKE_CASE__     :   list     ,	SCREAMING_SNAKE_CASE__     :   int     ,	SCREAMING_SNAKE_CASE__     :   int     ,	SCREAMING_SNAKE_CASE__     :   int							):
     __UpperCamelCase       				=int((lower_bound + upper_bound) // 2							)
     if array[r] == value:
          return r
     if lower_bound >= upper_bound:
          return -1
     if array[r] < value:
          return binary_search(SCREAMING_SNAKE_CASE__     ,	r + 1     ,	SCREAMING_SNAKE_CASE__     ,	SCREAMING_SNAKE_CASE__							)
     else:
          return binary_search(SCREAMING_SNAKE_CASE__     ,	SCREAMING_SNAKE_CASE__     ,	r - 1     ,	SCREAMING_SNAKE_CASE__							)

def 		_UpperCAmelCase							(     SCREAMING_SNAKE_CASE__     :   int     ,	SCREAMING_SNAKE_CASE__     :   list							):
     __UpperCamelCase       				=0
     if matrix[index][0] == value:
          return [index, 0]
     while index < len(SCREAMING_SNAKE_CASE__							) and matrix[index][0] < value:
          __UpperCamelCase       				=binary_search(matrix[index]     ,	0     ,	len(matrix[index]							) - 1     ,	SCREAMING_SNAKE_CASE__							)
          if r != -1:
               return [index, r]
          index += 1
     return [-1, -1]


if __name__ == "__main__":
   import doctest

   doctest.testmod()





