Problem Statement

Kuro and Shiro are playing with a board composed of $n$ squares lining up in a row. The squares are numbered $1$ to $n$ from left to right, and Square $s$ has a mark on it.

First, for each square, Kuro paints it black or white with equal probability, independently from other squares. Then, he puts on Square $s$ a stone of the same color as the square.

Kuro and Shiro will play a game using this board and infinitely many black stones and white stones. In this game, Kuro and Shiro alternately put a stone as follows, with Kuro going first:

1. Choose an empty square adjacent to a square with a stone on it. Let us say Square $i$ is chosen.
2. Put on Square $i$ a stone of the same color as the square.
3. If there are squares other than Square $i$ that contain a stone of the same color as the stone just placed, among such squares, let Square $j$ be the one nearest to Square $i$. Change the color of every stone between Square $i$ and Square $j$ to the color of Square $i$.

The game ends when the board has no empty square.

Kuro plays optimally to maximize the number of black stones at the end of the game, while Shiro plays optimally to maximize the number of white stones at the end of the game.

For each of the cases $s=1,\dots,n$, find the expected value, modulo $998244353$, of the number of black stones at the end of the game.

Note

When the expected value in question is represented as an irreducible fraction $p/q$, there uniquely exists an integer $r$ such that $rq=p ~(\text{mod } 998244353)$ and $0 \leq r \lt 998244353$, which we ask you to find.

Constraints

• $1 \leq n \leq 2\times 10^5$

Input

Input is given from Standard Input in the following format:

n

Output

Print $n$ values. The $i$-th value should be the expected value, modulo $998244353$, of the number of black stones at the end of the game for the case $s=i$.