MOD = 998244353

N = int(input())

if N == 0:
    print(0)
else:
    # Precompute factorials modulo MOD
    fact = [1] * (N + 1)
    for d in range(1, N + 1):
        fact[d] = fact[d-1] * d % MOD
    
    # Precompute inverse factorials modulo MOD
    inv_fact = [1] * (N + 1)
    inv_fact[N] = pow(fact[N], MOD-2, MOD)
    for d in range(N-1, -1, -1):
        inv_fact[d] = inv_fact[d+1] * (d+1) % MOD
    
    for i in range(N + 1):
        if i == 0:
            print(0)
        else:
            d = N - i
            if d % 2 == 0:
                sign = 1
            else:
                sign = MOD - 1
            res = sign * inv_fact[d] % MOD
            print(res)