#include<cstdio>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
using namespace std;
typedef unsigned long long ull;
constexpr int N=(1<<17)+5,MOD=998244353;
int qpow(ull a,int b,ull c=1)
{
	for(;b;b>>=1,(a*=a)%=MOD)if(b&1)(c*=a)%=MOD;
	return (int)c;
}
void reduce(int &x){(x>=MOD)&&(x-=MOD);}
void reduce_(int &x){(x<0)&&(x+=MOD);}
int n;
void fwt(int *a)
{
	for(int i=1;i<n;i<<=1)for(int j=0;j<n;++j,j+=j&i)
	{
		int x=a[j];
		reduce(a[j]+=a[j+i]);
		reduce_(a[j+i]=x-a[j+i]);
	}
}
int a[N],b[N];
int main()
{
	scanf("%d",&n);
	n=1<<n;
	F(i,0,n)scanf("%d",&a[i]);
	F(i,0,n)scanf("%d",&b[i]);
	fwt(a);fwt(b);
	F(i,0,n)a[i]=(int)((ull)a[i]*b[i]%MOD);
	fwt(a);
	int iv=qpow(n,MOD-2);
	F(i,0,n)a[i]=(int)((ull)iv*a[i]%MOD);
	F(i,0,n)printf("%d ",a[i]);
	puts("");
	return 0;
}