mod = 998244353
n = 2*10**5+5
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

N = int(input())
for K in range(1, N+1):
    ans = (N - K + 1) * K * fact[N - K] * fact[N + 1] * invfact[N + 1 - K - 1]
    ans *= pow(K + 1, mod - 2, mod)
    ans %= mod
    print(ans)