MOD = 998244353

def main():
    import sys
    K = int(sys.stdin.readline())
    max_n = 2 * K
    # Precompute factorial and inverse factorial modulo MOD
    factorial = [1] * (max_n + 1)
    for i in range(1, max_n + 1):
        factorial[i] = factorial[i-1] * i % MOD
    inv_fact = [1] * (max_n + 1)
    inv_fact[max_n] = pow(factorial[max_n], MOD-2, MOD)
    for i in range(max_n-1, -1, -1):
        inv_fact[i] = inv_fact[i+1] * (i+1) % MOD
    
    c = [0] * (2*K + 1)
    for a in range(1, K+1):
        two_a = 2 * a
        # Compute C(2a, a)
        C = factorial[two_a] * inv_fact[a] % MOD
        C = C * inv_fact[a] % MOD
        denominator = (two_a + 1) * C % MOD
        inv_den = pow(denominator, MOD-2, MOD)
        c[two_a] = (c[two_a] + inv_den) % MOD
    
    output = []
    for i in range(2*K + 1):
        output.append(str(c[i]))
    print(' '.join(output))

if __name__ == '__main__':
    main()