MOD = 998244353

n = int(input())

max_n = n
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

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