#include <bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
using namespace std;
typedef unsigned long long ull;
int n;
random_device rd;
mt19937_64 Rnd(1919810);
namespace Subtask1 {
	const int N = 5e3 + 5;
	ull val[N];
	int ans;
	vector<int> G1[N], G2[N];
	ull dis1[N], dis2[N];
	vector<ull> v1, v2;
	unordered_set<ull> S;
	void dfs1(int x, int fa, ull now)
	{
		// cout << x << ' ' << fa << ' ' << now << endl;
		now ^= val[x];
		S.insert(now);
		for (auto y : G1[x]) {
			if (y == fa) continue;
			dfs1(y, x, now);
		}
	}
	void dfs2(int x, int fa, ull now)
	{
		// cout << x << ' ' << fa << ' ' << now << endl;
		now ^= val[x];
		ans += S.count(now);
		for (auto y : G2[x]) {
			if (y == fa) continue;
			dfs2(y, x, now);
		}
	}
	void Main()
	{
		for (int i = 2; i <= n; i++)
		{
			int x;
			cin >> x;
			G1[x].push_back(i);G1[i].push_back(x);
		}
		for (int i = 2; i <= n; i++)
		{
			int x;
			cin >> x;
			G2[x].push_back(i);G2[i].push_back(x);
		}
		for (int i = 1; i <= n; i++) val[i] = Rnd();
		fr(i, 1, n) dfs1(i, 0, 0);
		fr(i, 1, n) dfs2(i, 0, 0);
		// v1.reserve(n * (n - 1) / 2);
		// v2.reserve(n * (n - 1) / 2);
		cout << (ans+n)/2 << endl;
	}
}
int main()
{
	cin >> n;
	Subtask1::Main();
	return 0;
}