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

typedef long long ll;
const int maxn = 3e5 + 5;
const ll mod = 998244353;

int n, m;
ll A[maxn], B[maxn], C[maxn];

void FWT(ll *p, int typ, bool Fl)
{
    if (typ == 0)
    {
        for (int i = 1; i < m; i <<= 1)
            for (int j = 0; j < m; j++)
                if (i & j)
                {
                    if (Fl) p[j] += p[j ^ i], p[j] = p[j] >= mod ? p[j] - mod : p[j];
                    else p[j] -= p[j ^ i], p[j] = p[j] < 0 ? p[j] + mod : p[j];
                }
    }
    else if (typ == 1)
    {
        for (int i = 1; i < m; i <<= 1)
            for (int j = 0; j < m; j++)
                if (i & j)
                {
                    if (Fl) p[j] -= p[j ^ i], p[j] = p[j] < 0 ? p[j] + mod : p[j];
                    else p[j] += p[j ^ i], p[j] = p[j] >= mod ? p[j] - mod : p[j];
                }
    }
    else if (typ == 2)
    {
        for (int i = 1; i < m; i <<= 1)
            for (int j = 0; j < m; j++)
                if (i & j)
                {
                    if (Fl)
                    {
                        ll X = p[j ^ i], Y = p[j];
                        p[j ^ i] = X + Y >= mod ? X + Y - mod : X + Y;
                        p[j] = X < Y ? X - Y + mod : X - Y;
                    }
                    else
                    {
                        ll X = p[j ^ i], Y = p[j];
                        p[j ^ i] = (X + Y) & 1 ? (X + Y + mod) >> 1 : (X + Y) >> 1;
                        if (p[j ^ i] >= mod) p[j ^ i] -= mod;
                        p[j] = (X - Y) & 1 ? (X - Y + mod) >> 1 : (X - Y) >> 1;
                        if (p[j] < 0) p[j] += mod;
                    }
                }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n, m = (1 << n);
    for (int i = 0; i < m; i++) cin >> A[i];
    for (int i = 0; i < m; i++) cin >> B[i];
    FWT(A, 1, 1); FWT(B, 1, 1);
    for (int i = 0; i < m; i++) C[i] = A[i] * B[i] % mod;
    FWT(C, 1, 0);
    for (int i = 0; i < m; i++) cout << C[i] << " ";
    return 0;
}