"""simple docstring"""






from functools import lru_cache



@lru_cache
def 						a_		(      lowerCamelCase ):






				if num < 0:
								raise ValueError('Number should not be negative.' )

				return 1 if num in (0, 1) else num * factorial(num - 1 )


if __name__ == "__main__":
						import doctest

						doctest.testmod()




"""simple docstring"""






def 						a_		(      lowerCamelCase      ,    lowerCamelCase ):
				return x if y == 0 else greatest_common_divisor(lowerCamelCase      ,    x % y )



def 						a_		(      lowerCamelCase      ,    lowerCamelCase ):
				return (x * y) // greatest_common_divisor(lowerCamelCase      ,    lowerCamelCase )



def 						a_		(      lowerCamelCase = 2_0 ):
				UpperCAmelCase__    =							1
				for i in range(1      ,    n + 1 ):
								UpperCAmelCase__    =							lcm(lowerCamelCase      ,    lowerCamelCase )
				return g


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



