
def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int)   ->       str:






							'''simple docstring'''





							__UpperCamelCase      :  int       =   int(_lowerCamelCase)
							if decimal in (0, 1):  # Exit cases for the recursion
														return str(_lowerCamelCase)
							__UpperCamelCase  ,		__UpperCamelCase      :  Union[str, Any]       =   divmod(_lowerCamelCase		,    2)
							return binary_recursive(_lowerCamelCase) + str(_lowerCamelCase)




def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     str)   ->       str:






							'''simple docstring'''





							__UpperCamelCase      :  int       =   str(_lowerCamelCase).strip()
							if not number:
														raise ValueError("No input value was provided")
							__UpperCamelCase      :  Tuple       =   "-" if number.startswith("-") else ""
							__UpperCamelCase      :  Optional[Any]       =   number.lstrip("-")
							if not number.isnumeric():
														raise ValueError("Input value is not an integer")
							return F'{negative}0b{binary_recursive(int(_lowerCamelCase))}'


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

		testmod()

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






							'''simple docstring'''





							__UpperCamelCase      :  int       =   1
							__UpperCamelCase      :  Any       =   2

							__UpperCamelCase      :  Dict       =   0
							__UpperCamelCase      :  Any       =   0
							__UpperCamelCase      :  List[Any]       =   0
							while perimeter <= max_perimeter:
														perimeters_sum += perimeter

														prev_value += 2 * value
														value += prev_value

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

							return perimeters_sum


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