def 	__A		(      _A				,					_A       ):



 """simple docstring"""


 return x if y == 0 else greatest_common_divisor(_A				,					x % y       )



def 	__A		(      _A				,					_A       ):



 """simple docstring"""


 return (x * y) // greatest_common_divisor(_A				,					_A       )



def 	__A		(      _A = 20       ):



 """simple docstring"""


 __a							=	1
 for i in range(1				,					n + 1       ):
  __a							=	lcm(_A				,					_A       )
 return g


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







'''simple docstring'''



import os

lowerCAmelCase_  :							Union[str, Any]             =    {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
def        UpperCAmelCase (    A	:					str					):
							SCREAMING_SNAKE_CASE       :   str         =      0

							SCREAMING_SNAKE_CASE       :   List[str]         =      0
							while index < len(A					) - 1:
														SCREAMING_SNAKE_CASE       :   Dict         =      SYMBOLS[numerals[index]]
														SCREAMING_SNAKE_CASE       :   str         =      SYMBOLS[numerals[index + 1]]
														if current_value < next_value:
																					total_value -= current_value
														else:
																					total_value += current_value
														index += 1
							total_value += SYMBOLS[numerals[index]]

							return total_value
def        UpperCAmelCase (    A	:					int					):
							SCREAMING_SNAKE_CASE       :   Any         =      ''''''

							SCREAMING_SNAKE_CASE       :   Dict         =      num // 1000
							numerals += m_count * "M"
							num %= 1000

							SCREAMING_SNAKE_CASE       :   str         =      num // 100
							if c_count == 9:
														numerals += "CM"
														c_count -= 9
							elif c_count == 4:
														numerals += "CD"
														c_count -= 4
							if c_count >= 5:
														numerals += "D"
														c_count -= 5
							numerals += c_count * "C"
							num %= 100

							SCREAMING_SNAKE_CASE       :   Any         =      num // 10
							if x_count == 9:
														numerals += "XC"
														x_count -= 9
							elif x_count == 4:
														numerals += "XL"
														x_count -= 4
							if x_count >= 5:
														numerals += "L"
														x_count -= 5
							numerals += x_count * "X"
							num %= 10

							if num == 9:
														numerals += "IX"
														num -= 9
							elif num == 4:
														numerals += "IV"
														num -= 4
							if num >= 5:
														numerals += "V"
														num -= 5
							numerals += num * "I"

							return numerals
def        UpperCAmelCase (    A	:					str = "/p089_roman.txt"					):
							SCREAMING_SNAKE_CASE       :   List[str]         =      0

							with open(os.path.dirname(A					) + roman_numerals_filename					) as filea:
														SCREAMING_SNAKE_CASE       :   str         =      filea.readlines()

							for line in lines:
														SCREAMING_SNAKE_CASE       :   Any         =      line.strip()
														SCREAMING_SNAKE_CASE       :   Union[str, Any]         =      parse_roman_numerals(A					)
														SCREAMING_SNAKE_CASE       :   Any         =      generate_roman_numerals(A					)
														savings += len(A					) - len(A					)

							return savings


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




