MOD = 998244353

def main():
    import sys
    input = sys.stdin.read
    N = int(input().strip())
    
    # 预计算阶乘和逆阶乘
    max_d = N
    fact = [1] * (max_d + 1)
    for i in range(1, max_d + 1):
        fact[i] = fact[i-1] * i % MOD
    
    inv_fact = [1] * (max_d + 1)
    inv_fact[max_d] = pow(fact[max_d], MOD-2, MOD)
    for i in range(max_d-1, -1, -1):
        inv_fact[i] = inv_fact[i+1] * (i+1) % MOD
    
    for i in range(0, N + 1):
        if i == 0:
            print(0)
            continue
        d = N - i
        if d < 0:
            print(0)
            continue
        sign = 1 if d % 2 == 0 else MOD - 1
        inv = inv_fact[d]
        res = sign * inv % MOD
        print(res)
    
if __name__ == "__main__":
    main()