MOD = 998244353
max_n = 200000

# Precompute factorials and inverse factorials
fact = [1] * (max_n + 1)
for i in range(1, max_n + 1):
    fact[i] = fact[i-1] * i % MOD

inv_fact = [1] * (max_n + 1)
inv_fact[max_n] = pow(fact[max_n], MOD-2, MOD)
for i in range(max_n - 1, -1, -1):
    inv_fact[i] = inv_fact[i+1] * (i+1) % MOD

N = int(input())
for i in range(N + 1):
    if i == 0:
        print(0)
    else:
        j = N - i
        if j % 2 == 0:
            sign = 1
        else:
            sign = MOD - 1
        res = sign * inv_fact[j] % MOD
        print(res)