#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
const ll N = (1<<17)+5, mod = 998244353;
ll pw(ll x,ll y){
    ll ans = 1;
    while (y){
        if (y&1) ans = ans*x %mod;
        x = x*x %mod;
        y >>= 1;
    }
    return ans;
}
ll n,m;
ll a[N],b[N];
void Xor(ll n,ll *a,ll v){
    ll len,i,j;
    for (len=1; len<n; len<<=1)
        for (i=0; i<n; i+=len<<1)
            fr(j,0,len-1){
                ll x = a[i|j], y = a[i|j|len];
                ( a[i|j] = x+y ) %=mod;
                ( a[i|j|len] = x-y ) %=mod;
            }
    if (v==-1){
        ll x = pw(n,mod-2);
        fr(i,0,n-1) a[i] = a[i]*x %mod;
    }
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    ll i,j;
    read(n); n = 1<<n;
    fr(i,0,n-1) read(a[i]);
    fr(i,0,n-1) read(b[i]);
    Xor(n,a,1);
    Xor(n,b,1);
    fr(i,0,n-1) a[i] = a[i]*b[i] %mod;
    Xor(n,a,-1);
    fr(i,0,n-1) write(a[i]), putchar(' ');
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2