Problem Statement

Snuke found a random number generator. It generates an integer between $0$ and $2^N-1$ (inclusive). An integer sequence $A_0, A_1, \cdots, A_{2^N-1}$ represents the probability that each of these integers is generated. The integer $i$ ($0 \leq i \leq 2^N-1$) is generated with probability $A_i / S$, where $S = \sum_{i=0}^{2^N-1} A_i$. The process of generating an integer is done independently each time the generator is executed.

Snuke has an integer $X$, which is now $0$. He can perform the following operation any number of times:

• Generate an integer $v$ with the generator and replace $X$ with $X \oplus v$, where $\oplus$ denotes the bitwise XOR.

For each integer $i$ ($0 \leq i \leq 2^N-1$), find the expected number of operations until $X$ becomes $i$, and print it modulo $998244353$. More formally, represent the expected number of operations as an irreducible fraction $P/Q$. Then, there exists a unique integer $R$ such that $R \times Q \equiv P \mod 998244353,\ 0 \leq R < 998244353$, so print this $R$.

We can prove that, for every $i$, the expected number of operations until $X$ becomes $i$ is a finite rational number, and its integer representation modulo $998244353$ can be defined.

Constraints

• $1 \leq N \leq 18$
• $1 \leq A_i \leq 1000$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_0 A_1 \cdots A_{2^N-1}

Output

Print $2^N$ lines. The $(i+1)$-th line ($0 \leq i \leq 2^N-1$) should contain the expected number of operations until $X$ becomes $i$, modulo $998244353$.