MOD = 998244353

N = int(input())

if N == 0:
    print(0)
else:
    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:
            power = (N - i) % 2
            sign = 1 if power == 0 else MOD - 1
            res = sign * fact[N-1] % MOD
            res = res * inv_fact[i-1] % MOD
            res = res * inv_fact[N - i] % MOD
            res = res * inv_fact[N - i] % MOD
            print(res)