#include <bits/stdc++.h>
using namespace std;

template<typename T, T MOD = 1000000007>
struct Mint{
  static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T, T MOD> constexpr T Mint<T, MOD>::mod;
template<typename T, T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}

template<typename F>
struct FixPoint : F{
  FixPoint(F&& f):F(forward<F>(f)){}
  template<typename... Args>
  decltype(auto) operator()(Args&&... args) const{
    return F::operator()(*this,forward<Args>(args)...);
  }
};

template<typename F>
inline decltype(auto) MFP(F&& f){
  return FixPoint<F>{forward<F>(f)};
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  using M = Mint<int, 998244353>;
  using V = vector<M>;
  auto split=[&](V zs){
    int n=zs.size();
    V xs(zs.begin()+0,zs.begin()+n/2);
    V ys(zs.begin()+n/2,zs.begin()+n);
    return make_pair(xs,ys);
  };
  auto merge=[&](V xs,V ys){
    V zs;
    for(auto e:xs) zs.emplace_back(e);
    for(auto e:ys) zs.emplace_back(e);
    return zs;
  };
  auto add=[&](V xs,V ys){
    for(int i=0;i<(int)xs.size();i++) xs[i]+=ys[i];
    return xs;
  };
  auto sub=[&](V xs,V ys){
    for(int i=0;i<(int)xs.size();i++) xs[i]-=ys[i];
    return xs;
  };

  int n;
  cin>>n;
  vector<M> as(1<<n),bs(1<<n);
  for(auto &e:as) cin>>e.v;
  for(auto &e:bs) cin>>e.v;

  V cs=MFP([&](auto dfs,V ps,V qs)->V{
      int n=ps.size();
      if(n==1) return V{{M(ps[0]*qs[0])}};
      auto[p0,p1]=split(ps);
      auto[q0,q1]=split(qs);
      V upper=dfs(add(p0,p1),q0);
      V lower=dfs(p1,sub(q1,q0));
      return merge(upper,add(upper,lower));
    })(as,bs);

  for(int i=0;i<(int)cs.size();i++){
    if(i) cout<<' ';
    cout<<cs[i];
  }
  cout<<endl;
  return 0;
}