#include <bits/stdc++.h>

const int N = 1e6 + 10, mod = 998244353;

inline int read()
{
    int x = 0, f = 0; char ch = getchar();
    while (!isdigit(ch)) f |= ch == '-', ch = getchar();
    while ( isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
    return f ? -x : x;
}

inline int chk(int a) { return a >= mod ? a - mod : a; }
inline void upd(int &a, int b) { a = a + b >= mod ? a + b - mod : a + b; }

int a[N], b[N];

inline void XOR(int *a, int n, int x = 0)
{
    int w = 1 << n;
    for (int l = 2; l <= w; l <<= 1)
        for (int i = 0, m = l >> 1; i < w; i += l)
            for (int j = 0; j < m; ++j)
            {
                int p = a[i + j], q = a[i + j + m];
                a[i + j] = chk(p + q), a[i + j + m] = chk(p - q + mod);
                if (x)
                {
                    a[i + j] = 1LL * a[i + j] * (mod + 1) / 2 % mod;
                    a[i + j + m] = 1LL * a[i + j + m] * (mod + 1) / 2 % mod;
                }
            }
}

int main()
{
    int n = read();
    for (int i = 0; i < (1 << n); ++i) a[i] = read();
    for (int i = 0; i < (1 << n); ++i) b[i] = read();
    XOR(a, n), XOR(b, n);
    for (int i = 0; i < (1 << n); ++i) a[i] = 1LL * a[i] * b[i] % mod;
    XOR(a, n, 1);
    for (int i = 0; i < (1 << n); ++i) printf("%d ", a[i]);
    return 0;
}