




"""simple docstring"""




from __future__ import annotations



def        a__					(							snake_case__							)		->   int:
			lowerCamelCase      =   len(snake_case__							) // 2

			# choose the middle 3 elements
			lowerCamelCase      =   lst[m - 1 : m + 2]

			# if middle element is peak
			if three[1] > three[0] and three[1] > three[2]:
						return three[1]

			# if increasing, recurse on right
			elif three[0] < three[2]:
						if len(lst[:m]							) == 2:
									m -= 1
						return peak(lst[m:]							)

			# decreasing
			else:
						if len(lst[:m]							) == 2:
									m += 1
						return peak(lst[:m]							)


if __name__ == "__main__":
					import doctest

					doctest.testmod()









"""simple docstring"""




def        a__					(							snake_case__ = 50_00_00_00							)		->   int:
			lowerCamelCase      =   set()
			lowerCamelCase      =   int((limit - 24) ** (1 / 2)							)

			lowerCamelCase      =   set(range(3			,					prime_square_limit + 1			,					2							)							)
			primes.add(2							)
			for p in range(3			,					prime_square_limit + 1			,					2							):
						if p not in primes:
									continue
						primes.difference_update(set(range(p * p			,					prime_square_limit + 1			,					snake_case__							)							)							)

			for primea in primes:
						lowerCamelCase      =   primea * primea
						for primea in primes:
									lowerCamelCase      =   primea * primea * primea
									if square + cube >= limit - 16:
												break
									for primea in primes:
												lowerCamelCase      =   primea * primea * primea * primea
												lowerCamelCase      =   square + cube + tetr
												if total >= limit:
															break
												ret.add(snake_case__							)

			return len(snake_case__							)


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



