#include <bits/stdc++.h>
#define LL long long
#define sl(n) strlen(n)
#define endline puts("")
#define pii pair<int , int>
#define pr_q priority_queue
#define debug puts("DEBUG.")
using namespace std;
const int N = (1 << 19) + 10;
const int inf = ~0u >> 2;
const int p = 998244353;
inline int getmod(int x)
	{return x >= p ? x - p : x;}
int n,a[22][N],b[22][N],c[22][N];
void fwt(int *f , int op)
{
	for(int len = 1;len < n;len <<= 1)
		for(int i = 0;i < n;i += len * 2)
			for(int j = 0;j < len;j++)
				f[i + j + len] = getmod( f[i + j + len] + ( op == 1 ? f[i + j] : p - f[i + j] ) );
}
int main()
{
	cin >> n;
	int len = n;
	n = 1 << n;
	for(int i = 0;i < n;i++)
		scanf("%d" , a[ __builtin_popcount(i) ] + i);
	for(int i = 0;i < n;i++)
		scanf("%d" , b[ __builtin_popcount(i) ] + i);
	for(int i = 0;i <= len;i++)
		fwt(a[i] , 1),fwt(b[i] , 1);
	for(int i = 0;i <= len;i++)
		for(int j = 0;j <= i;j++)
			for(int k = 0;k < n;k++)
				c[i][k] = (c[i][k] + 1ll * a[j][k] * b[i - j][k] ) % p;
	for(int i = 0;i <= len;i++)
		fwt(c[i] , -1);
	for(int i = 0;i < n;i++)
		printf( "%d " , c[__builtin_popcount(i) ][i] );
	endline;
	return 0;
}