/*
Author: QAQAutomaton
Lang: C++
Code: F.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define int long long
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int inf;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T,class T2>int chkmin(T &a,T2 b){return a>b?a=b,1:0;}
template<class T,class T2>int chkmax(T &a,T2 b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T,class T2>T mmin(T a,T2 b){return a<b?a:b;}
template<class T,class T2>T mmax(T a,T2 b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__{
	__INIT__(){
		memset(&inf,0x3f,sizeof(inf));
	}
}__INIT___;
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	template<typename A>
	inline bool read (A &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		while((x=gc())==' '||x=='\n' || x=='\r');
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r');
		if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'||*x==EOF))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	template<typename A>
	inline bool write (A x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
int a[1<<18|5];
const int p=998244353;
int fpm(int a,int b){
	int c=1;for(;b;b>>=1,a=a*a%p)if(b&1)c=c*a%p;
	return c;
}
int Mod(int x){return x>=p?x-p:x;}
pii f[1<<18|5],g[1<<18|5],h[1<<18|5];
pii tp(int x){return make_pair(x,0);}
pii operator +(pii a,pii b){
	return make_pair(Mod(a.x+b.x),Mod(a.y+b.y));
}
pii operator -(pii a,pii b){
	return make_pair(Mod(a.x+p-b.x),Mod(a.y+p-b.y));
}
pii operator *(pii a,int b){
	return make_pair(a.x*b%p,a.y*b%p);
}
void FWT(pii *a,int n){
	for(int i=1;i<1<<n;i<<=1){
		for(int j=0;j<1<<n;++j)if(!(j&i)){
			pii u=a[j],v=a[j|i];
			a[j]=u+v;
			a[j|i]=u-v;
		}
	}
}
void iFWT(pii *a,int n){
	for(int i=1;i<1<<n;i<<=1){
		for(int j=0;j<1<<n;++j)if(!(j&i)){
			pii u=a[j],v=a[j|i];
			a[j]=(u+v)*((p+1)>>1);
			a[j|i]=(u-v)*((p+1)>>1);
		}
	}
}


signed main(){
#ifdef QAQAutoMaton 
	freopen("F.in","r",stdin);
	freopen("F.out","w",stdout);
#endif
	int n;
	read(n);
	int s=0;
	for(int i=0;i<1<<n;++i){read(a[i]);s+=a[i];}
	s=fpm(s,p-2);
	for(int i=0;i<1<<n;++i)a[i]=a[i]*s%p;
	for(int i=1;i<1<<n;++i){
		g[i].x=p-1;
		h[i].x=a[i];
	}
	g[0].x=(1<<n)-1;
	h[0].x=a[0]-1;
	if(h[0].x<0)h[0].x+=p;
	FWT(g,n);
	FWT(h,n);
	for(int i=1;i<1<<n;++i){
		f[i].x=g[i].x*fpm(h[i].x,p-2)%p;
	}
	f[0].y=1;
	iFWT(f,n);
	int w=(p-f[0].x)*fpm(f[0].y,p-2)%p;
	// f[0].x+f[0].y*x=0
	write(0,'\n');
	for(int i=1;i<1<<n;++i){
		write((f[i].x+f[i].y*w)%p,'\n');
	}
	return 0;
}


Measured memory_bytes: 21248