



"""simple docstring"""






snake_case   					=				6_5_5_2_1




def 			snake_case		(		lowerCAmelCase_	)						->				int:
  _snake_case   	=      1
  _snake_case   	=      0
  for plain_chr in plain_text:
    _snake_case   	=      (a + ord(lowerCAmelCase_	)) % MOD_ADLER
    _snake_case   	=      (b + a) % MOD_ADLER
  return (b << 16) | a









def    a__    (		snake_case__					:							int						,   snake_case__					:							int     ):
  return x if y == 0 else greatest_common_divisor(snake_case__						,   x % y     )




def    a__    (		snake_case__					:							int						,   snake_case__					:							int     ):
  return (x * y) // greatest_common_divisor(snake_case__						,   snake_case__     )




def    a__    (		snake_case__					:							int = 20     ):
  _UpperCAmelCase		:							Union[str, Any]							=     1
  for i in range(1						,   n + 1     ):
    _UpperCAmelCase		:							Dict							=     lcm(snake_case__						,   snake_case__     )
  return g


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





