#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
typedef unsigned long long ull;
mt19937_64 rnd(0x66ccff);
inline ull Rnd(ull x){
	x^=x<<13;
	x^=x>>7;
	x^=x<<17;
	return x;
}
int gcd(int x,int y){
	return y?gcd(y,x%y):x;
}
int n,m,a[N],sz[N],b[N],ans;
ull f[N],V,va[N];
vector<int>e[N];
void dfs(int x){
	
}
bool check(int y){
	for(int x=n;x;--x)if(sz[x]>=y){
		if(sz[x]==y){
			if(f[x]!=va[y])return false;
		}
		ull o=V;
		for(auto v:e[x])if(sz[v]<y)o+=Rnd(f[v]);
		if(o!=va[y])return false;
	}
	return true;
}
void solve(){
	V=rnd(),ans=1;
	for(int i=1;i<=n;++i)e[i].clear();
	for(int i=2,x;i<=n;++i){
		scanf("%d",&x);
		e[x].push_back(i);
	}
	for(int x=n;x;--x){
		sz[x]=1,f[x]=V;
		for(auto v:e[x]){
			sz[x]+=sz[v];
			f[x]+=Rnd(f[v]);
		}
		va[sz[x]]=f[x];
	}
	for(int i=1;i<=n;++i)b[i]=sz[i];
	sort(b+1,b+n+1);
	for(int i=n-1;i;--i)b[i]=gcd(b[i],b[i+1]);
	m=unique(b+1,b+n+1)-b-1;
	for(int i=2;i<m;++i)if(b[i])++ans;
	printf("%d\n",ans);
}
int main(){
	while(scanf("%d",&n)!=EOF)solve();
	return 0;
}