




"""simple docstring"""




def        a__					(							snake_case__			,					snake_case__			,					snake_case__							)		->   list:
			lowerCamelCase      =   len(snake_case__							)
			lowerCamelCase      =   [[0] * n for i in range(snake_case__							)]
			for i in range(snake_case__							):
						lowerCamelCase      =   y_points[i]

			for i in range(2			,					snake_case__							):
						for j in range(snake_case__			,					snake_case__							):
									lowerCamelCase      =   (
									    (xa - x_points[j - i + 1]) * q[j][i - 1]
									    - (xa - x_points[j]) * q[j - 1][i - 1]
									) / (x_points[j] - x_points[j - i + 1])

			return [q[n - 1][n - 1], q]


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() = }""")



