#include <bits/stdc++.h>
#define PII pair<int, int>
#define ull unsigned long long
#define ll long long
using namespace std;
const int N = 2e5 + 10;
const int M = 2e5 + 3;

mt19937_64 rnd(chrono :: steady_clock :: now().time_since_epoch().count());
inline int read() {
	char ch = getchar(); int x = 0;
	while (!isdigit(ch)) {ch = getchar();}
	while (isdigit(ch)) {x = x * 10 + ch - 48; ch = getchar();}
	return x;
}

int n;
vector<int> g[N], G[N];

namespace subtask1 {
	int ans;
	ull val[N];
	vector<ull> vec[2];
	
	void dfs1(int x, int fa, ull now) {
		now ^= val[x];
		vec[0].push_back(now);
		for (auto y : g[x])
			if (y != fa) dfs1(y, x, now);
	}
	
	void dfs2(int x, int fa, ull now) {
		now ^= val[x];
		vec[1].push_back(now);
		for (auto y : G[x])
			if (y != fa) dfs2(y, x, now);
	}
	
	void solve() {
		vec[0].reserve(n * n);
		vec[1].reserve(n * n);
		for (int i = 1; i <= n; ++i) val[i] = rnd();
		for (int i = 1; i <= n; ++i) dfs1(i, i, 0);
		for (int i = 1; i <= n; ++i) dfs2(i, i, 0);
		sort(vec[0].begin(), vec[0].end());
		sort(vec[1].begin(), vec[1].end());
		for (int i = 0, j = 0; i < vec[0].size(); ++i) {
			while (j < vec[1].size() && vec[1][j] < vec[0][i]) j++;
			if (j == vec[1].size()) break;
			if (j < vec[1].size() && vec[0][i] == vec[1][j]) ans++;
		}
		ans = (ans + n) / 2;
		printf("%d\n", ans);
	}
}

namespace subtask2 {
	int id[N], a[N], cnt[N * 3];
	ll ans;
	vector<PII> vec[N][3];
	
	bool check() {
		for (int i = 1; i <= n; ++i)
			if (g[i].size() > 2 || G[i].size() > 2) return false;
		return true;
	}
	
	void dfs1(int x, int fa, int d) {
		id[x] = d;
		for (auto y : g[x])
			if (y != fa) dfs1(y, x, d + 1);
	}
	
	void dfs2(int x, int fa, int d) {
		a[d] = id[x];
		for (auto y : G[x])
			if (y != fa) dfs2(y, x, d + 1);
	}
	
	void work(int l, int r) {
		if (l > r) return;
		if (l == r) return ans++, void();
		int mid = (l + r) >> 1;
		for (int i = mid, mn = 1e9, mx = -1e9, p = mid, q = mid; i >= l; --i) {
			mn = min(mn, a[i]); mx = max(mx, a[i]);
			while (p < r && a[p + 1] >= mn) p++;
			while (q < r && a[q + 1] <= mx) q++;
			for (int o = 0, posl, posr; o < 4; ++o) {
				posl = mid + 1; posr = r;
				if (o & 1) posl = max(posl, p + 1);
				else posr = min(posr, p);
				if (o & 2) posl = max(posl, q + 1);
				else posr = min(posr, q);
				if (posl > posr) continue;
				if (o == 0) ans += (posl <= i + mx - mn && i + mx - mn <= posr);
				else if (o == 1) vec[posl - 1][0].push_back(make_pair(mx + i, -1)), vec[posr][0].push_back(make_pair(mx + i, 1));
				else if (o == 2) vec[posl - 1][1].push_back(make_pair(i - mn, -1)), vec[posr][1].push_back(make_pair(i - mn, 1));
				else vec[posl - 1][2].push_back(make_pair(i, -1)), vec[posr][2].push_back(make_pair(i, 1));
			}
		}
		for (int i = mid + 1, mn = 1e9; i <= r; ++i) {
			mn = min(mn, a[i]);
			cnt[i + mn + M]++;
			for (auto tmp : vec[i][0]) ans += tmp.second * cnt[tmp.first + M];
		}
		for (int i = mid + 1, mn = 1e9; i <= r; ++i) {
			mn = min(mn, a[i]);
			cnt[i + mn + M]--;
		}
		for (int i = mid + 1, mx = -1e9; i <= r; ++i) {
			mx = max(mx, a[i]);
			cnt[i - mx + M]++;
			for (auto tmp : vec[i][1]) ans += tmp.second * cnt[tmp.first + M];
		}
		for (int i = mid + 1, mx = -1e9; i <= r; ++i) {
			mx = max(mx, a[i]);
			cnt[i - mx + M]--;
		}
		for (int i = mid + 1, mn = 1e9, mx = -1e9; i <= r; ++i) {
			mn = min(mn, a[i]); mx = max(mx, a[i]);
			cnt[i + mn - mx + M]++;
			for (auto tmp : vec[i][2]) ans += tmp.second * cnt[tmp.first + M];
		}
		for (int i = mid + 1, mn = 1e9, mx = -1e9; i <= r; ++i) {
			mn = min(mn, a[i]); mx = max(mx, a[i]);
			cnt[i + mn - mx + M]--;
		}
		for (int i = mid; i <= r; ++i) vec[i][0].clear(), vec[i][1].clear(), vec[i][2].clear();
		work(l, mid); work(mid + 1, r);
	}
	
	void solve() {
		for (int i = 1; i <= n; ++i)
			if (g[i].size() == 1) dfs1(i, i, 1);
		for (int i = 1; i <= n; ++i)
			if (G[i].size() == 1) dfs2(i, i, 1);
		work(1, n);
		printf("%lld\n", ans);
	}
}

int main() {
	#ifdef zyc
		freopen("in.in", "r", stdin);
		freopen("mine.out", "w", stdout);
	#endif
	n = read();
	for (int i = 2, x; i <= n; ++i) x = read(), g[x].push_back(i), g[i].push_back(x);
	for (int i = 2, x; i <= n; ++i) x = read(), G[x].push_back(i), G[i].push_back(x);
	if (n <= 5000) subtask1 :: solve();
	else if (subtask2 :: check()) subtask2 :: solve();
	return 0;
}