


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__ = 20   ):
   __a					=  1
   for i in range(1		,				n + 1   ):
      __a					=  lcm(lowerCAmelCase__		,				lowerCAmelCase__   )
   return g


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











'''simple docstring'''







def       __UpperCamelCase					(      lowercase_       :  int = 1_000_000   ):
       """simple docstring"""




       a_						     =			set(range(3   ,       lowercase_   ,       2   )   )
       primes.add(2   )
       for p in range(3   ,       lowercase_   ,       2   ):
              if p not in primes:
                     continue
              primes.difference_update(set(range(p * p   ,       lowercase_   ,       lowercase_   )   )   )

       a_						     =			[float(lowercase_   ) for n in range(limit + 1   )]

       for p in primes:
              for n in range(lowercase_   ,       limit + 1   ,       lowercase_   ):
                     phi[n] *= 1 - 1 / p

       return int(sum(phi[2:]   )   )


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




