





"""simple docstring"""





def 					__A  (_SCREAMING_SNAKE_CASE = 10**9     )   ->int:





  """simple docstring"""


  lowerCAmelCase__     :Tuple											=				1
  lowerCAmelCase__     :List[str]											=				2

  lowerCAmelCase__     :List[Any]											=				0
  lowerCAmelCase__     :Tuple											=				0
  lowerCAmelCase__     :Any											=				0
  while perimeter <= max_perimeter:
    perimeters_sum += perimeter

    prev_value += 2 * value
    value += prev_value

    lowerCAmelCase__     :Optional[Any]											=				2 * value + 2 if i % 2 == 0 else 2 * value - 2
    i += 1

  return perimeters_sum


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







"""simple docstring"""





def 					__A  (_SCREAMING_SNAKE_CASE     )   ->str:





  """simple docstring"""


  lowerCAmelCase__     :List[Any]											=				int(_SCREAMING_SNAKE_CASE     )
  if decimal in (0, 1):  # Exit cases for the recursion
    return str(_SCREAMING_SNAKE_CASE     )
  lowerCAmelCase__				,							lowerCAmelCase__     :int											=				divmod(_SCREAMING_SNAKE_CASE	,  2     )
  return binary_recursive(_SCREAMING_SNAKE_CASE     ) + str(_SCREAMING_SNAKE_CASE     )
def 					__A  (_SCREAMING_SNAKE_CASE     )   ->str:





  """simple docstring"""


  lowerCAmelCase__     :str											=				str(_SCREAMING_SNAKE_CASE     ).strip()
  if not number:
    raise ValueError('No input value was provided'     )
  lowerCAmelCase__     :Dict											=				'-' if number.startswith('-'     ) else ''
  lowerCAmelCase__     :int											=				number.lstrip('-'     )
  if not number.isnumeric():
    raise ValueError('Input value is not an integer'     )
  return F"{negative}0b{binary_recursive(int(_SCREAMING_SNAKE_CASE     )     )}"


if __name__ == "__main__":
  from doctest import testmod

  testmod()
