





'''simple docstring'''






def 					_a						(       _lowerCamelCase ) ->				bool:



			"""simple docstring"""


			__snake_case					:      str							      =     (1 + 24 * n) ** 0.5
			return ((1 + root) / 6) % 1 == 0







def 					_a						(       _lowerCamelCase = 5000 ) ->				int:



			"""simple docstring"""


			__snake_case					:      str							      =     [(i * (3 * i - 1)) // 2 for i in range(1    ,	_lowerCamelCase )]
			for i, pentagonal_i in enumerate(_lowerCamelCase ):
						for j in range(_lowerCamelCase    ,	len(_lowerCamelCase ) ):
									__snake_case					:      int							      =     pentagonal_nums[j]
									__snake_case					:      Tuple							      =     pentagonal_i + pentagonal_j
									__snake_case					:      str							      =     pentagonal_j - pentagonal_i
									if is_pentagonal(_lowerCamelCase ) and is_pentagonal(_lowerCamelCase ):
												return b

			return -1


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







"""simple docstring"""






def      _lowercase							(    __snake_case      )		->  float:
			return 10 - x * x


def      _lowercase							(    __snake_case   ,__snake_case      )		->  float:
			# Bolzano theory in order to find if there is a root between a and b
			if equation(__snake_case      ) * equation(__snake_case      ) >= 0:
						raise ValueError("Wrong space!"      )

			__lowerCAmelCase :    List[Any]				=			a
			while (b - a) >= 0.01:
						# Find middle point
						__lowerCAmelCase :    str				=			(a + b) / 2
						# Check if middle point is root
						if equation(__snake_case      ) == 0.0:
									break
						# Decide the side to repeat the steps
						if equation(__snake_case      ) * equation(__snake_case      ) < 0:
									__lowerCAmelCase :    List[Any]				=			c
						else:
									__lowerCAmelCase :    List[str]				=			c
			return c


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	print(bisection(-2, 5))
	print(bisection(0, 6))