





def lowerCamelCase__    (							snake_case_	:  List[str]       ,      snake_case_	:  Optional[int]       )      ->				Any:
   if number < 0 or shift_amount < 0:
      raise ValueError('''both inputs must be positive integers'''       )

   __snake_case							       =   str(bin(UpperCamelCase_       )       )
   binary_number += "0" * shift_amount
   return binary_number






def lowerCamelCase__    (							snake_case_	:  Union[str, Any]       ,      snake_case_	:  Optional[Any]       )      ->				Union[str, Any]:
   if number < 0 or shift_amount < 0:
      raise ValueError('''both inputs must be positive integers'''       )

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






def lowerCamelCase__    (							snake_case_	:  Tuple       ,      snake_case_	:  List[Any]       )      ->				Tuple:
   if number >= 0:  # Get binary representation of positive number
      __snake_case							       =   '''0''' + str(bin(UpperCamelCase_       )       ).strip('''-'''       )[2:]
   else:  # Get binary (2's complement) representation of negative number
      __snake_case							       =   len(bin(UpperCamelCase_       )[3:]       )  # Find 2's complement of number
      __snake_case							       =   bin(abs(UpperCamelCase_       ) - (1 << binary_number_length)       )[3:]
      __snake_case							       =   (
          '''1''' + '''0''' * (binary_number_length - len(UpperCamelCase_       )) + binary_number
      )

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


if __name__ == "__main__":
    import doctest

    doctest.testmod()



"""simple docstring"""





def 						_lowerCAmelCase				(				UpperCamelCase_ = 100				):
		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = 0
		for i in range(1  ,				n + 1				):
				sum_of_squares += i**2
				sum_of_ints += i
		return sum_of_ints**2 - sum_of_squares


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




