



'''simple docstring'''



from __future__ import annotations

import math



def   __lowerCAmelCase					(							lowerCamelCase   :						List[str]				,		lowerCamelCase   :						Dict					):






	'''simple docstring'''




	__lowerCAmelCase												=  u
	for i in range(1				,		lowerCamelCase					):
		__lowerCAmelCase												=  temp * (u - i)
	return temp



def   __lowerCAmelCase					(							):






	'''simple docstring'''




	__lowerCAmelCase												=  int(input("enter the numbers of values: "					)					)
	__lowerCAmelCase												=  []
	for _ in range(lowerCamelCase					):
		y.append([]					)
	for i in range(lowerCamelCase					):
		for j in range(lowerCamelCase					):
			y[i].append(lowerCamelCase					)
			__lowerCAmelCase												=  0

	print("enter the values of parameters in a list: "					)
	__lowerCAmelCase												=  list(map(lowerCamelCase				,		input().split()					)					)

	print("enter the values of corresponding parameters: "					)
	for i in range(lowerCamelCase					):
		__lowerCAmelCase												=  float(input()					)

	__lowerCAmelCase												=  int(input("enter the value to interpolate: "					)					)
	__lowerCAmelCase												=  (value - x[0]) / (x[1] - x[0])

	# for calculating forward difference table

	for i in range(1				,		lowerCamelCase					):
		for j in range(n - i					):
			__lowerCAmelCase												=  y[j + 1][i - 1] - y[j][i - 1]

	__lowerCAmelCase												=  y[0][0]
	for i in range(1				,		lowerCamelCase					):
		summ += (ucal(lowerCamelCase				,		lowerCamelCase					) * y[0][i]) / math.factorial(lowerCamelCase					)

	print(f'''the value at {value} is {summ}'''					)


if __name__ == "__main__":
	main()




'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						Union[str, Any]					):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  2
	while i * i <= n:
		__lowerCAmelCase												=  0
		while n % i == 0:
			n //= i
			multiplicity += 1
		n_divisors *= multiplicity + 1
		i += 1
	if n > 1:
		n_divisors *= 2
	return n_divisors



def   __lowerCAmelCase					(							):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  1

	while True:
		i += 1
		t_num += i

		if count_divisors(lowerCamelCase					) > 5_00:
			break

	return t_num


if __name__ == "__main__":
	print(solution())