MOD = 998244353

def main():
    import sys
    N = int(sys.stdin.readline())
    if N == 0:
        print(0)
        return
    
    # Precompute factorial and inverse factorial mod MOD
    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
    
    # Compute a_i for each i from 0 to N
    for i in range(N + 1):
        if i == 0:
            print(0)
        else:
            k = N - i
            if k < 0:
                print(0)
                continue
            if k % 2 == 0:
                sign = 1
            else:
                sign = MOD - 1
            a = sign * inv_fact[k] % MOD
            print(a)
    
if __name__ == "__main__":
    main()