#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int n, f[200005], a[200005], rt[200005], fail[200005];
struct node {
	int name, num;
};
vector<node> son[200005];
struct XDN {
	int l, r, ls, rs, num = 0;
} b[5000006];
int ccnt = 0;
inline void insert(int p, int l, int r, int q, int w) {
	b[p].l = l, b[p].r = r;
	if (l == r) {
		b[p].num = w;
		return;
	}
	if (q <= ((l + r) >> 1)) {
		b[p].ls = ++ccnt;
		insert(ccnt, l, (l + r) >> 1, q, w);
	} else {
		b[p].rs = ++ccnt;
		insert(ccnt, ((l + r) >> 1) + 1, r, q, w);
	}
}
inline int change(int p, int q, int w) {
	b[++ccnt] = b[p];
	p = ccnt;
	if (b[p].l == b[p].r) {
		b[p].num = w;
		return p;
	}
	if (q <= (b[p].l + b[p].r) / 2) {
		if (!b[p].ls) {
			b[p].ls = ++ccnt;
			insert(ccnt, (b[p].l), (b[p].l + b[p].r) >> 1, q, w);
		} else {
			b[p].ls = change(b[p].ls, q, w);
		}
	} else {
		if (!b[p].rs) {
			b[p].rs = ++ccnt;
			insert(ccnt, ((b[p].l + b[p].r) >> 1) + 1, b[p].r, q, w);
		} else {
			b[p].rs = change(b[p].rs, q, w);
		}
	}
	return p;
}
inline int query(int p, int q) {
	if (b[p].l == b[p].r) return b[p].num;
	if (q <= (b[p].l + b[p].r) / 2) {
		if (!b[p].ls) return 0;
		return query(b[p].ls, q);
	} else {
		if (!b[p].rs) return 0;
		return query(b[p].rs, q);
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> f[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		son[f[i]].push_back(node{a[i], i});
	}
	ccnt = 1;
	b[1].l = 1, b[1].r = n;
	rt[0] = 1;
	for (int i = 0; i < son[0].size(); i++) {
		rt[0] = change(rt[0], son[0][i].name, son[0][i].num);
	}
	queue<int> q;
	for (int i = 0; i < son[0].size(); i++) {
		q.push(son[0][i].num);
	}
	while (q.size()) {
		int i = q.front();
		q.pop();
		if (f[i] == 0) {
			fail[i] = 0;
		} else {
			fail[i] = query(rt[fail[f[i]]], a[i]);
		}
		rt[i] = rt[fail[i]];
		for (int j = 0; j < son[i].size(); j++) {
			rt[i] = change(rt[i], son[i][j].name, son[i][j].num);
			q.push(son[i][j].num);
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << fail[i] << ' ';
	}
}