#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
	int s=0,w=1;char ch;
	while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mod=998244353;
ll f[1048576];
ll g[1048576];
int n;
inline void FMT(ll *f,bool fmt=true)
{
	for(int j=0;j<n;j++) for(int i=0;i<(1<<n);i++) if(i&(1<<j))
	{
		if(fmt) f[i]=(f[i]+f[i^(1<<j)])%mod;
		else f[i]=(f[i]-f[i^(1<<j)]+mod)%mod;
	}
}
int main()
{
	n=read();
	for(int i=0;i<(1<<n);i++) f[i]=read();
	for(int i=0;i<(1<<n);i++) g[i]=read();
	FMT(f),FMT(g);
	for(int i=0;i<(1<<n);i++) f[i]=f[i]*g[i]%mod;
	FMT(f,false);
	for(int i=0;i<(1<<n);i++) printf("%lld ",f[i]);
	return 0;
}