MOD = 998244353
N = int(input())

fac = [1] * (N + 1)
for i in range(2, N + 1):
    fac[i] = fac[i - 1] * i % MOD

def comb(n, k):
    if k > n:
        return 0
    return fac[n] * pow(fac[k], MOD - 2, MOD) % MOD * pow(fac[n - k], MOD - 2, MOD) % MOD

ans = [0] * (N + 1)

for i in range(N + 1):
    ans[abs(2 * i - N)] += comb(N, i)
    ans[abs(2 * i - N)] %= MOD

print(*ans)