#include<bits/stdc++.h>
using namespace std;
#define RI register int
inline int read() {
    RI x=0, w=0;register char ch=0;
    while(!isdigit(ch)) w|=ch=='-', ch=getchar();
    while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48), ch=getchar();
    return w?-x:x;
}
mt19937 rnd(time(0));
const int MAXN=2e5+10, MAXLOG=18, inf=1e9;
int N, val[MAXN]; long long ans; 
namespace T2 {
	vector<int> dian[MAXN]; 
	int dep[MAXN], depv[MAXN], id[MAXN], siz[MAXN], anc[MAXLOG][MAXN], cnt; 
	inline void Add(int x, int y) { dian[x].push_back(y); }	
	inline void dfs(int x, int fa) {
		anc[0][x]=fa, id[x]=++cnt; siz[x]=1;
		dep[x]=dep[fa]+1, depv[x]=depv[fa]^val[x];
		for(RI i=1;i<MAXLOG;i++) anc[i][x]=anc[i-1][anc[i-1][x]]; 
		for(RI nx:dian[x]) dfs(nx,x), siz[x]+=siz[nx]; 
	}
	inline int LCA(int x, int y) {
		if(dep[x]<dep[y]) swap(x,y);
		for(RI i=MAXLOG-1;i>=0;i--) 
			if(dep[anc[i][x]]>=dep[y]) x=anc[i][x];
		if(x==y) return x;
		for(RI i=MAXLOG-1;i>=0;i--)
			if(anc[i][x]!=anc[i][y]) x=anc[i][x], y=anc[i][y];
		return anc[0][x];
	}
	inline int jump(int x, int y) {
		for(RI i=MAXLOG-1;i>=0;i--)
			if(dep[anc[i][x]]>=dep[y]) x=anc[i][x];
		return x; 
	}
	inline int get(int x, int y) {
		if(id[x]>=id[y] && id[x]<id[y]+siz[y]) return jump(x,y);
		else return anc[0][y]; 
	} // Çó x ÔÚ y µÄÄĸö×ÓÊ÷ÖÐ 
	inline int dis(int x, int y) { return dep[x]+dep[y]-2*dep[LCA(x,y)]; }
	inline int disv(int x, int y) { return depv[x]^depv[y]^val[LCA(x,y)]; } 
}	
namespace T1 {
	vector<int> dian[MAXN]; bool vis[MAXN]; 
	int Root, Siz, siz[MAXN], k1[MAXN], k2[MAXN], dep[MAXN];
	unordered_map<int,int> m, m1, m2[MAXN]; vector<int> v; 
	inline void Add(int x, int y) { dian[x].push_back(y); }
	inline void getroot(int x, int fa) {
		siz[x]=1; int maxn=0; 
		for(RI nx:dian[x]) if(nx!=fa && !vis[nx]) 
			getroot(nx,x), siz[x]+=siz[nx], maxn=max(maxn,siz[nx]); 	
		maxn=max(maxn,Siz-siz[x]); if(maxn<=Siz/2) Root=x;  
	} 
	inline void predfs(int x, int fa) {
		siz[x]=1, dep[x]=dep[fa]^val[x]; 
		if(x==Root) k1[x]=k2[x]=x; 
		else {
			int t1=T2::dis(k1[fa],k2[fa]), t2=T2::dis(x,k1[fa]), t3=T2::dis(x,k2[fa]), maxn=max({t1,t2,t3}); 
			k1[x]=k1[fa], k2[x]=k2[fa]; if(t2==maxn) k2[x]=x; else if(t3==maxn) k1[x]=x; 
		} for(RI nx:dian[x]) if(nx!=fa && !vis[nx]) predfs(nx,x), siz[x]+=siz[nx]; 	
	} 
	inline void dfs1(int x, int fa) {
		ans+=m[T2::disv(k1[x],k2[x])^val[Root]^dep[x]]; 
		for(RI nx:dian[x]) if(nx!=fa && !vis[nx]) dfs1(nx,x); 	
	}
	inline void dfs2(int x, int fa) {
		m[dep[x]]++;
		for(RI nx:dian[x]) if(nx!=fa && !vis[nx]) dfs2(nx,x); 	
	}
	inline void dfs3(int x, int fa) {
		int p1=T2::get(k1[x],Root), p2=T2::get(k2[x],Root);
		int t1=T2::disv(k1[x],Root)^dep[x], t2=T2::disv(k2[x],Root)^dep[x];
		ans+=m1[t1]-m2[p1][t1]+m1[t2]-m2[p2][t2];
		for(RI nx:dian[x]) if(nx!=fa && !vis[nx]) dfs3(nx,x); 	
	}
	inline void dfs4(int x, int fa) {
		int p1=T2::get(k1[x],Root), p2=T2::get(k2[x],Root);
		int t1=T2::disv(k1[x],Root)^dep[x], t2=T2::disv(k2[x],Root)^dep[x];
		m1[t1]++, m1[t2]++, m2[p1][t1]++, m2[p2][t2]++, v.push_back(p1), v.push_back(p2); 
		for(RI nx:dian[x]) if(nx!=fa && !vis[nx]) dfs4(nx,x); 	
	}
	inline void solve(int x) {
		m.clear(); m1.clear(); 
		for(RI nx:v) m2[nx].clear(); v.clear(); predfs(x,0); 
		for(RI i=0;i<dian[x].size();i++) {
			int nx=dian[x][i]; if(vis[nx]) continue ; 
			dfs1(nx,x), dfs2(nx,x), dfs3(nx,x), dfs4(nx,x); 
		} m.clear(); m[val[x]]++;
		for(RI i=dian[x].size()-1;i>=0;i--) {
			int nx=dian[x][i]; if(vis[nx]) continue ;
			dfs1(nx,x), dfs2(nx,x); 
		} vis[x]=1;
		for(RI nx:dian[x]) if(!vis[nx]) 
			Siz=siz[nx], getroot(nx,x), solve(Root); 	
	}
	inline void doit() { Siz=N; getroot(1,0); solve(Root); }
}
signed main() {
//	freopen("a.in","r",stdin); 
	N=read(); int x;
	for(RI i=1;i<=N;i++) val[i]=rnd()%inf+1; 
	for(RI i=2;i<=N;i++) x=read(), T1::Add(i,x), T1::Add(x,i);
	for(RI i=2;i<=N;i++) x=read(), T2::Add(x,i); 
	T2::dfs(1,0); T1::doit(); cout<<ans+N<<endl;
//	cout<<(val[1]^val[2])<<" "<<T2::disv(1,2)<<endl;
    return 0;
}// May all the beauty be blessed.