MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().strip()
    N = int(input)
    
    # Precompute factorial and inverse factorial
    max_n = N
    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
    
    for i in range(N + 1):
        if i == 0:
            print(0)
        else:
            exponent = N - i
            if exponent % 2 == 0:
                sign = 1
            else:
                sign = MOD - 1
            a_i = sign * inv_fact[exponent] % MOD
            print(a_i)
    
if __name__ == "__main__":
    main()