#include <atcoder/modint>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
using mint = atcoder::modint998244353;

mint get() {
    int x;
    cin >> x;
    return mint::raw(x);
}

void solve() {
    int n;
    cin >> n;

    vector<mint> xs(1 << n), ys(1 << n);
    generate(xs.begin(), xs.end(), [] { return get(); });
    generate(ys.begin(), ys.end(), [] { return get(); });

    for (int i = 1; i < (1 << n); i <<= 1) {
        for (int b = 0; b < (1 << n); ++b) {
            if (b & i) {
                // upper zeta on A (xs)
                xs[b ^ i] += xs[b];

                // mobius on B (ys)
                ys[b] -= ys[b ^ i];
            }
        }
    }

    vector<mint> zs(1 << n);
    for (int b = 0; b < (1 << n); ++b) zs[b] = xs[b] * ys[b];

    for (int i = 1; i < (1 << n); i <<= 1) {
        for (int b = 0; b < (1 << n); ++b) {
            if (b & i) {
                // lower zeta on C (zs)
                zs[b] += zs[b ^ i];
            }
        }
    }

    for (auto z : zs) cout << z.val() << " ";
    cout << "\n";
}

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

    solve();

    return 0;
}