






'''simple docstring'''







from math import factorial
def 						A__			(				__lowerCAmelCase		:			Any = 20						):
						lowerCamelCase__         =  2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
						# 2, 3,...
						lowerCamelCase__         =  n // 2

						return int(factorial(SCREAMING_SNAKE_CASE_						) / (factorial(SCREAMING_SNAKE_CASE_						) * factorial(n - k						))						)


if __name__ == "__main__":
							import sys

							if len(sys.argv) == 1:
														print(solution(20))
							else:
														try:
																					UpperCamelCase    :      Optional[int]     =		int(sys.argv[1])
																					print(solution(n))
														except ValueError:
																					print('Invalid entry - please enter a number.')









'''simple docstring'''







def 						A__			(				):
						return [
						    a * b * (1000 - a - b)
						    for a in range(1   ,    999						)
						    for b in range(__lowerCAmelCase   ,    999						)
						    if (a * a + b * b == (1000 - a - b) ** 2)
						][0]


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

