#include<cstdio>
#include<iostream>
#include<tuple>
#include<algorithm>
const int mod = 998244353,inv2 = mod + 1 >> 1;
typedef long long ll;
inline static const void reduce(int&x){x+=x>>31&mod;}
inline static const void mulor(int*a,int*b,int*c,int lm){
	if(!(lm/=2))return void(*c=ll(*a)**b%mod);
	for(int i=0;i<lm;++i)reduce(a[i+lm]+=a[i]-mod),reduce(b[i+lm]+=b[i]-mod);
	mulor(a,b,c,lm),mulor(a+lm,b+lm,c+lm,lm);
	for(int i=0;i<lm;++i)reduce(c[i+lm]-=c[i]);
}
inline static const void muland(int*a,int*b,int*c,int lm){
	if(!(lm/=2))return void(*c=ll(*a)**b%mod);
	for(int i=0;i<lm;++i)reduce(a[i]+=a[i+lm]-mod),reduce(b[i]+=b[i+lm]-mod);
	muland(a,b,c,lm),muland(a+lm,b+lm,c+lm,lm);
	for(int i=0;i<lm;++i)reduce(c[i]-=c[i+lm]);
}
inline static const void mulxor(int*a,int*b,int*c,int lm){
	if(!(lm/=2))return void(*c=ll(*a)**b%mod);
	for(int i=0;i<lm;++i){
		std::tie(a[i],a[i+lm])=std::make_tuple(a[i]+a[i+lm],a[i]-a[i+lm]);
		std::tie(b[i],b[i+lm])=std::make_tuple(b[i]+b[i+lm],b[i]-b[i+lm]);
		reduce(a[i+lm]),reduce(b[i+lm]),reduce(a[i]-=mod),reduce(b[i]-=mod);
	}
	mulxor(a,b,c,lm),mulxor(a+lm,b+lm,c+lm,lm);
	for(int i=0;i<lm;++i)std::tie(c[i],c[i+lm])=std::make_tuple(ll(c[i]+c[i+lm])*inv2%mod,ll(c[i]-c[i+lm]+mod)*inv2%mod);
}
int n;
int a[1 << 17],b[1 << 17],c[1 << 17];
int d[1 << 17],e[1 << 17],f[1 << 17];
int g[1 << 17],h[1 << 17],i[1 << 17];
int main(){
	std::ios::sync_with_stdio(false),std::cin.tie(0);
	std::cin >> n;
	for(int i=0;i<1<<n;++i)std::cin >> a[i],d[i]=g[i]=a[i];
	for(int i=0;i<1<<n;++i)std::cin >> b[i],e[i]=h[i]=b[i];
	mulor(a,b,c,1<<n);
	// muland(d,e,f,1<<n);
	// mulxor(g,h,i,1<<n);
	for(int i=0;i<1<<n;++i)std::cout << c[i] << ' ';
	// std::cout << '\n';
	// for(int i=0;i<1<<n;++i)std::cout << f[i] << ' ';
	// std::cout << '\n';
	// for(int i=0;i<1<<n;++i)std::cout << ::i[i] << ' ';
}