




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



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



def       UpperCAmelCase__  (     lowerCamelCase = 20   ):
  lowercase    :Any      	=						1
  for i in range(1,			n + 1   ):
    lowercase    :Optional[int]      	=						lcm(lowerCamelCase,			lowerCamelCase   )
  return g


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









from abc import ABC, abstractmethod
from argparse import ArgumentParser




class    __lowerCAmelCase       (							lowerCAmelCase):






       @staticmethod
       @abstractmethod
       def 					SCREAMING_SNAKE_CASE    (   _lowerCAmelCase:					ArgumentParser				):
         raise NotImplementedError()






       @abstractmethod
       def 					SCREAMING_SNAKE_CASE    (   self:					List[str]				):
         raise NotImplementedError()



