




"""simple docstring"""






def 							UpperCAmelCase		(		snake_case			:					Tuple      ,       snake_case			:					Optional[Any]      ,       snake_case			:					Optional[Any]      ,       snake_case			:					str    ):
					if height >= 1:
										move_tower(height - 1      ,       snake_case      ,       snake_case      ,       snake_case    )
										move_disk(snake_case      ,       snake_case    )
										move_tower(height - 1      ,       snake_case      ,       snake_case      ,       snake_case    )





def 							UpperCAmelCase		(		snake_case			:					List[Any]      ,       snake_case			:					Union[str, Any]    ):
					print('''moving disk from'''      ,       snake_case      ,       '''to'''      ,       snake_case    )





def 							UpperCAmelCase		(		):
					_lowerCAmelCase:Union[str, Any]									=  int(input('''Height of hanoi: '''    ).strip()    )
					move_tower(snake_case      ,       '''A'''      ,       '''B'''      ,       '''C'''    )


if __name__ == "__main__":
				main()












"""simple docstring"""






def 							UpperCAmelCase		(		snake_case			:					int      ,       snake_case			:					int    ):
					return x if y == 0 else greatest_common_divisor(snake_case      ,       x % y    )





def 							UpperCAmelCase		(		snake_case			:					int      ,       snake_case			:					int    ):
					return (x * y) // greatest_common_divisor(snake_case      ,       snake_case    )





def 							UpperCAmelCase		(		snake_case			:					int = 20    ):
					_lowerCAmelCase:List[Any]									=  1
					for i in range(1      ,       n + 1    ):
										_lowerCAmelCase:List[str]									=  lcm(snake_case      ,       snake_case    )
					return g


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






