MOD = 998244353

def main():
    import sys
    input = sys.stdin.read
    N = int(input().strip())
    
    # Precompute factorials up to N+1
    max_fact = N + 1
    fact = [1] * (max_fact + 1)
    for i in range(1, max_fact + 1):
        fact[i] = fact[i-1] * i % MOD
    
    # Precompute inverse for each number 1..N+1
    max_inv = N + 1
    inv = [1] * (max_inv + 1)
    for i in range(1, max_inv + 1):
        inv[i] = pow(i, MOD-2, MOD)
    
    # Compute answers for each K
    ans = []
    for K in range(1, N + 1):
        term = K * (N - K + 1) % MOD
        term = term * fact[N+1] % MOD
        term = term * inv[K+1] % MOD
        ans.append(term)
    
    # Output each answer in order
    print('\n'.join(map(str, ans)))

if __name__ == "__main__":
    main()