#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 19;
const int ha = 998244353;

inline void add(int &x,int y){
    x += y-ha;x += x>>31&ha;
}

int f[MAXN+1][(1<<MAXN)+3],g[MAXN+1][(1<<MAXN)+3],h[MAXN+1][(1<<MAXN)+3];
int n,N;

inline void FWT(int f[]){
    FOR(i,0,n-1){
        FOR(S,0,(1<<n)-1){
            if((S>>i)&1) add(f[S],f[S^(1<<i)]);
        }
    }
}

inline void IFWT(int f[]){
    ROF(i,n-1,0){
        FOR(S,0,(1<<n)-1){
            if((S>>i)&1) add(f[S],ha-f[S^(1<<i)]);
        }
    }
}

int main(){
    scanf("%d",&n);N = (1<<n);
    FOR(i,0,N-1) scanf("%d",&f[__builtin_popcount(i)][i]);
    FOR(i,0,N-1) scanf("%d",&g[__builtin_popcount(i)][i]);
    FOR(i,0,n) FWT(f[i]),FWT(g[i]);
    FOR(i,0,n){
        FOR(j,0,n-i){
            FOR(k,0,N-1) add(h[i+j][k],1ll*f[i][k]*g[j][k]%ha);
        }
    }
//    FOR(i,0,n) DEBUG(h[i][N-1]);
    FOR(i,0,n) IFWT(h[i]);
    FOR(i,0,N-1) printf("%d ",h[__builtin_popcount(i)][i]);puts("");
    return 0;
}