





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


if __name__ == "__main__":
    import doctest

    doctest.testmod()








def lowerCamelCase__    (							)      ->				int:
   return [
       a * b * (1000 - a - b)
       for a in range(1       ,      999       )
       for b in range(snake_case_       ,      999       )
       if (a * a + b * b == (1000 - a - b) ** 2)
   ][0]


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

