




SCREAMING_SNAKE_CASE__       :      Optional[int]  =   65521

def      A      (      _SCREAMING_SNAKE_CASE    )	-> int:
       lowerCamelCase   :      List[str]			 =					1
       lowerCamelCase   :      str			 =					0
       for plain_chr in plain_text:
              lowerCamelCase   :      Dict			 =					(a + ord(_SCREAMING_SNAKE_CASE    )) % MOD_ADLER
              lowerCamelCase   :      Any			 =					(b + a) % MOD_ADLER
       return (b << 16) | a












def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> int:
       return x if y == 0 else greatest_common_divisor(_SCREAMING_SNAKE_CASE ,x % y    )

def      A      (      _SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )	-> int:
       return (x * y) // greatest_common_divisor(_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )

def      A      (      _SCREAMING_SNAKE_CASE = 20    )	-> int:
       lowerCamelCase   :      List[Any]			 =					1
       for i in range(1 ,n + 1    ):
              lowerCamelCase   :      List[str]			 =					lcm(_SCREAMING_SNAKE_CASE ,_SCREAMING_SNAKE_CASE    )
       return g


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






