






'''simple docstring'''







def 						A__			(				__lowerCAmelCase		:			List[Any]						):
						assert (
						    isinstance(UpperCamelCase__   ,    UpperCamelCase__						) and number_of_steps > 0
						), F'''number_of_steps needs to be positive integer, your input {number_of_steps}'''
						if number_of_steps == 1:
												return 1
						lowerCamelCase__       ,			lowerCamelCase__         =  1, 1
						for _ in range(number_of_steps - 1						):
												lowerCamelCase__       ,			lowerCamelCase__         =  current + previous, current
						return current


if __name__ == "__main__":
							import doctest

							doctest.testmod()









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

