mod = 998244353
N = int(input())

if N == 0:
    print(1)
    exit()

fact = [1] * (N + 1)
inv_fact = [1] * (N + 1)

for i in range(1, N + 1):
    fact[i] = fact[i-1] * i % mod

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

ans = [0] * (N + 1)
ans[N] = 1  # a_N is 1

for i in range(1, N):
    # a_i = (-1)^(N-i) / (N-i)! mod mod
    k = N - i
    sign = (-1) ** k
    inv = inv_fact[k]
    ans[i] = (mod - inv) % mod if (k % 2 == 1) else inv

for a in ans:
    print(a)