#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
ll A[1<<20],B[1<<20],C[1<<20];
const ll mo=998244353;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	M=1<<N;
	FOR(i,M) cin>>A[i];
	FOR(i,M) cin>>B[i];
	FOR(i,N) FOR(j,M) if(j&(1<<i)) (A[j^(1<<i)]+=A[j])%=mo;
	FOR(i,N) FOR(j,M) if(j&(1<<i)) (B[j]+=mo-B[j^(1<<i)])%=mo;
	FOR(j,M) C[j]=A[j]*B[j]%mo;
	FOR(i,N) FOR(j,M) if(j&(1<<i)) (C[j]+=C[j^(1<<i)])%=mo;
	FOR(i,M) cout<<C[i]<<" ";
	cout<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}