
import math





def 			lowerCamelCase_ (				lowerCamelCase__    ):
				lowerCamelCase_						=			math.loga(math.sqrt(4 * positive_integer + 1    ) / 2 + 1 / 2    )

				return exponent == int(SCREAMING_SNAKE_CASE_    )





def 			lowerCamelCase_ (				lowerCamelCase__ = 1 / 1_2_3_4_5    ):
				lowerCamelCase_						=			0
				lowerCamelCase_						=			0

				lowerCamelCase_						=			3
				while True:
								lowerCamelCase_						=			(integer**2 - 1) / 4
								# if candidate is an integer, then there is a partition for k
								if partition_candidate == int(SCREAMING_SNAKE_CASE_    ):
												lowerCamelCase_						=			int(SCREAMING_SNAKE_CASE_    )
												total_partitions += 1
												if check_partition_perfect(SCREAMING_SNAKE_CASE_    ):
																perfect_partitions += 1
								if perfect_partitions > 0:
												if perfect_partitions / total_partitions < max_proportion:
																return int(SCREAMING_SNAKE_CASE_    )
								integer += 1


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






"""simple docstring"""




from __future__ import annotations


def     lowercase			(SCREAMING_SNAKE_CASE_		:				str  )   ->						list[int]:
						return [ord(SCREAMING_SNAKE_CASE_  ) - 96 for elem in plain]


def     lowercase			(SCREAMING_SNAKE_CASE_		:				list[int]  )   ->						str:
						return "".join(chr(elem + 96  ) for elem in encoded  )


def     lowercase			()   ->						None:
						SCREAMING_SNAKE_CASE													=					encode(input('-> '  ).strip().lower()  )
						print('Encoded: ' ,			SCREAMING_SNAKE_CASE_  )
						print('Decoded:' ,			decode(SCREAMING_SNAKE_CASE_  )  )


if __name__ == "__main__":
	main()


