#include<bits/stdc++.h>

using lld=long long;

const int N=20,mod=998244353;

int n;

lld A[1<<N|5],B[1<<N|5];

void FWT(lld *F,int ty){
    for(int h=1;h<(1<<n);h<<=1)
        for(int i=0;i<(1<<n);i+=(h<<1))
            for(int j=0;j<h;++j){
                lld t1=F[i+j],t2=F[i+j+h];
                F[i+j]=ty*(t1+t2)%mod,F[i+j+h]=ty*(t1-t2)%mod;
            }
}

int main(){
    scanf("%d",&n);
    for(int i=0;i<(1<<n);++i) scanf("%lld",A+i);
    for(int i=0;i<(1<<n);++i) scanf("%lld",B+i);
    FWT(A,1),FWT(B,1);
    for(int i=0;i<(1<<n);++i) (A[i]*=B[i])%=mod;
    FWT(A,-1);
    lld inv2=(mod+1)/2,pw=1;
    for(int i=1;i<=n;++i) (pw*=inv2)%=mod;
    for(int i=0;i<(1<<n);++i) printf("%lld%c",(A[i]*pw%mod+mod)%mod," \n"[i+1==(1<<n)]);
    return 0;
}