#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
#define eb emplace_back
#define uint unsigned int 
using namespace std;
const int N = 1 << 20;

namespace MTT {
	const double pi = acos(-1);
	struct CP {
		double x, y;
		CP (double X = 0, double Y = 0) {
			x = X;
			y = Y;
		}
		inline CP rev() {
			return CP(x, -y);
		}
	};
	CP operator + (CP a, CP b) {
		return CP(a.x + b.x, a.y + b.y);
	}
	CP operator - (CP a, CP b) {
		return CP(a.x - b.x, a.y - b.y);
	}
	CP operator * (CP a, CP b) {
		return CP(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x);
	}
	CP Pow[N], iPow[N];
	int Lim, rev[N], lim;
	void revlim() {
		L(i, 0, lim - 1) rev[i] = (rev[i >> 1] >> 1) + ((i & 1) * (lim >> 1));
	}
	void up(int x) {
		for(lim = 1; lim <= x; lim <<= 1);
	}
	void FFT(CP *f, int op) {
		L(i, 0, lim - 1) if(rev[i] < i) swap(f[i], f[rev[i]]) ;
		for(int i = 2; i <= lim; i <<= 1) {
			for(int j = 0, l = i >> 1, ch = Lim / i; j < lim; j += i) {
				for(int k = j, now = 0; k < j + l; ++k) {
					CP pa = f[k], pb = f[k + l] * (op == 1 ? Pow[now] : iPow[now]);
					f[k] = pa + pb;
					f[k + l] = pa - pb;
					now += ch;
				}
			}
		}
		if(op == -1) 
			L(i, 0, lim - 1) 
				f[i].x /= lim, f[i].y /= lim;
	}
	const int K = 4;
	CP _f[K][N], _g[K][N], _h[K * 2 - 1][N];
	vector < ull > Mul(vector < ull > f, vector < ull > g) {
		const int size = 13, cnt = 4;
		const int L1 = cnt - 1, L2 = L1 * 2;
		int n = sz(f);
		int m = sz(g);
		up(n + m - 1);
		revlim();
		L(p, 0, L1) 
			L(i, 0, lim - 1) 
				_f[p][i] = _g[p][i] = CP(0);
		L(p, 0, L2)  
			L(i, 0, lim - 1) 
				_h[p][i] = CP(0);
		L(i, 0, n - 1) L(p, 0, L1) _f[p][i] = CP(f[i] & ((1LL << size) - 1), 0), f[i] >>= size;
		L(i, 0, m - 1) L(p, 0, L1) _g[p][i] = CP(g[i] & ((1LL << size) - 1), 0), g[i] >>= size;
		L(p, 0, L1)
			FFT(_f[p], 1);
		L(p, 0, L1)
			FFT(_g[p], 1);
		L(x, 0, L1) 
			L(y, 0, L1)
				L(i, 0, lim - 1) 
					_h[x + y][i] = _h[x + y][i] + _f[x][i] * _g[y][i];
		L(p, 0, L2) 
			FFT(_h[p], -1);
		vector < ull > ans(n + m - 1);
		L(p, 0, L2) {
			L(i, 0, n + m - 2) {
				ull w = round(_h[p][i].x);
				int tab = p * size;
				if(tab < 64) ans[i] += w << tab;
			}
		} 
		return ans;
	}
	void Pinit(int x) {
		up(x), Lim = lim;
		L(i, 0, Lim - 1) 
			Pow[i] = CP(cos(pi * 2 / Lim * i), sin(pi * 2 / Lim * i)), 
			iPow[i] = Pow[i].rev();
	}
}

int n;
uint a[N], b[N], c[N], p[N], Fac[N], iFac[N];
inline uint Inv(uint x) { 
	uint ans = 1;
	L(i, 1, 31) if((ans * x) >> i & 1) ans += 1LL << i;
	return ans;
}
int pop[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	MTT :: Pinit(n * 2 + 1);
	Fac[0] = iFac[0] = 1;
	L(i, 1, n) 
		p[i] = (i & 1) ? i : p[i / 2],
		Fac[i] = Fac[i - 1] * p[i], iFac[i] = iFac[i - 1] * Inv(p[i]);
	L(i, 1, n) 
		pop[i] = pop[i >> 1] + (i & 1);
	L(i, 0, n) {
		cin >> a[i]; 
	}
	L(i, 0, n) {
		cin >> b[i];
	}
	L(i, 0, n) a[i] *= iFac[i], b[i] *= iFac[i];
	vector < ull > A(n + 1), B(n + 1);
	L(i, 0, n) 
		A[i] = (ull) a[i] << pop[i], B[i] = (ull) b[i] << pop[i];
	auto C = MTT :: Mul(A, B);
	L(i, 0, n) c[i] = C[i] >> pop[i], c[i] *= Fac[i];
	L(i, 0, n) {
		cout << c[i] << ' ';
	} 
	cout << '\n';
	return 0;
}