def make_prime_table(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(2 * i, n + 1, i):
            is_prime[j] = False
    return is_prime


n = int(input())
MOD = 998244353


table = make_prime_table(n)
ans = 1
for val, flag in enumerate(table):
    if not flag:
        continue
    else:
        ok = 0
        ng = 20
        while abs(ok - ng) > 1:
            mid = (ok + ng) // 2
            if val ** mid <= n:
               ok = mid
            else:
               ng = mid
        ans *= val ** ok
        ans %= MOD
    max_val = val

print(ans * pow(max_val, MOD - 2, MOD) % MOD)