MOD = 998244353
MAX = 2 * 10**5 + 10

# Precompute factorial and inverse factorial
fact = [1] * (MAX)
for i in range(1, MAX):
    fact[i] = fact[i-1] * i % MOD

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

N = int(input())

for k in range(0, N+1):
    if k == 0:
        print(0)
    else:
        power = (N - k) % 2
        sign = 1 if power == 0 else MOD - 1  # (-1)^(N-k)
        
        # Calculate C(n-1, k-1)
        n_minus1 = N-1
        k_minus1 = k-1
        if k_minus1 < 0 or k_minus1 > n_minus1:
            comb = 0
        else:
            comb = fact[n_minus1] * inv_fact[k_minus1] % MOD
            comb = comb * inv_fact[n_minus1 - k_minus1] % MOD
        
        # inv_fact for (n -k)!
        term = N - k
        denominator = inv_fact[term] if term >=0 else 0
        res = sign * comb % MOD
        res = res * denominator % MOD
        print(res)