MOD = 998244353

def main():
    import sys
    N = int(sys.stdin.readline().strip())
    
    max_n = N
    # Precompute factorial and inverse factorial
    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
    
    results = [0] * (N + 1)
    
    if N == 0:
        print(1)
        return
    
    for i in range(0, N+1):
        if i == 0:
            results[i] = 0
            continue
        
        k = N - i
        sign = 1 if k % 2 == 0 else -1
        # Convert sign to MOD representation
        sign = 1 if sign == 1 else MOD - 1
        
        if i-1 > N-1 or N-1 <0:
            C = 0
        else:
            # C = C(N-1, i-1)
            C = fact[N-1] * inv_fact[i-1] % MOD
            C = C * inv_fact[(N-1) - (i-1)] % MOD
        
        term = C * inv_fact[k] % MOD
        term = term * sign % MOD
        
        results[i] = term
    
    for res in results:
        print(res)
        
if __name__ == "__main__":
    main()