#include <bits/stdc++.h>
using namespace std;

const int SZ = 1 << 18;
vector<int> G[2][SZ];
int in[2][SZ], out[2][SZ], dn;

struct Seg {
	vector<int> T[SZ << 1];
	void Build() {
		for (int i = SZ - 1; i > 0; --i) {
			T[i].resize(T[i * 2].size() + T[i * 2 + 1].size());
			merge(T[i * 2].begin(), T[i * 2].end(), T[i * 2 + 1].begin(), T[i * 2 + 1].end(), T[i].begin());
		}
	}
	int Query(int L, int R, int l, int r, int sL = 1, int sR = SZ, int n = 1) {
		if (R < sL || sR < L) return 0;
		if (L <= sL && sR <= R) {
			auto itR = upper_bound(T[n].begin(), T[n].end(), r);
			auto itL = lower_bound(T[n].begin(), T[n].end(), l);
			return itR - itL;
		}
		int mid = (sL + sR) >> 1;
		return (Query(L, R, l, r, sL, mid, n * 2) + Query(L, R, l, r, mid + 1, sR, n * 2 + 1));
	}
} T;

void DFS(int cur, int k) {
	in[k][cur] = ++dn;
	for (int next : G[k][cur]) DFS(next, k);
	out[k][cur] = dn;
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N;
	cin >> N;
	for (int t = 0; t < 2; ++t) {
		for (int i = 2; i <= N; ++i) {
			int p;
			cin >> p;
			G[t][p].push_back(i);
		}
		dn = 0;
		DFS(1, t);
	}

	for (int i = 1; i <= N; ++i) T.T[in[1][i] + SZ - 1].push_back(in[0][i]);
	T.Build();
	return 0;

	for (int i = 1; i <= N; ++i) {
		int l = in[0][i], r = out[0][i];
		int ans = T.Query(in[1][i], out[1][i], l, r) - 1;
		cout << ans << ' ';
	}
	return 0;
}