

def    _A							(						__snake_case  :int   , __snake_case  :int  )   -> str:



   """simple docstring"""


   if number < 0 or shift_amount < 0:
      raise ValueError("both inputs must be positive integers"  )

   __SCREAMING_SNAKE_CASE       =				str(bin(_lowercase  )  )
   binary_number += "0" * shift_amount
   return binary_number





def    _A							(						__snake_case  :int   , __snake_case  :int  )   -> str:



   """simple docstring"""


   if number < 0 or shift_amount < 0:
      raise ValueError("both inputs must be positive integers"  )

   __SCREAMING_SNAKE_CASE       =				str(bin(_lowercase  )  )[2:]
   if shift_amount >= len(_lowercase  ):
      return "0b0"
   __SCREAMING_SNAKE_CASE       =				binary_number[: len(_lowercase  ) - shift_amount]
   return "0b" + shifted_binary_number





def    _A							(						__snake_case  :int   , __snake_case  :int  )   -> str:



   """simple docstring"""


   if number >= 0:  # Get binary representation of positive number
      __SCREAMING_SNAKE_CASE       =				"0" + str(bin(_lowercase  )  ).strip("-"  )[2:]
   else:  # Get binary (2's complement) representation of negative number
      __SCREAMING_SNAKE_CASE       =				len(bin(_lowercase  )[3:]  )  # Find 2's complement of number
      __SCREAMING_SNAKE_CASE       =				bin(abs(_lowercase  ) - (1 << binary_number_length)  )[3:]
      __SCREAMING_SNAKE_CASE       =				(
          "1" + "0" * (binary_number_length - len(_lowercase  )) + binary_number
      )

   if shift_amount >= len(_lowercase  ):
      return "0b" + binary_number[0] * len(_lowercase  )
   return (
       "0b"
       + binary_number[0] * shift_amount
       + binary_number[: len(_lowercase  ) - shift_amount]
   )


if __name__ == "__main__":
     import doctest

     doctest.testmod()





"""simple docstring"""



def      UpperCAmelCase     (       _lowercase :   int = 1_0_0_0	)						-> int:


	"""simple docstring"""




	lowerCAmelCase_							,	lowerCAmelCase_      							=			1, 1
	lowerCAmelCase_      							=			[]
	for i in range(1			,   n + 1	):
		lowerCAmelCase_      							=			prev_numerator + 2 * prev_denominator
		lowerCAmelCase_      							=			prev_numerator + prev_denominator
		if len(str(_lowercase	)	) > len(str(_lowercase	)	):
			result.append(_lowercase	)
		lowerCAmelCase_      							=			numerator
		lowerCAmelCase_      							=			denominator

	return len(_lowercase	)


if __name__ == "__main__":
		print(f"""{solution() = }""")