#CF——Peculiar apple-tree（思维）

In Arcady's garden there grows a peculiar apple-tree that fruits one time per year. Its peculiarity can be explained in following way: there are n inflorescences, numbered from 1 to n. Inflorescence number 1 is situated near base of tree and any other inflorescence with number i (i > 1) is situated at the top of branch, which bottom is pi-th inflorescence and pi < i.

Once tree starts fruiting, there appears exactly one apple in each inflorescence. The same moment as apples appear, they start to roll down along branches to the very base of tree. Each second all apples, except ones in first inflorescence simultaneously roll down one branch closer to tree base, e.g. apple in a-th inflorescence gets to pa-th inflorescence. Apples that end up in first inflorescence are gathered by Arcady in exactly the same moment. Second peculiarity of this tree is that once two apples are in same inflorescence they annihilate. This happens with each pair of apples, e.g. if there are 5 apples in same inflorescence in same time, only one will not be annihilated and if there are 8 apples, all apples will be annihilated. Thus, there can be no more than one apple in each inflorescence in each moment of time.

Help Arcady with counting number of apples he will be able to collect from first inflorescence during one harvest.

Input

First line of input contains single integer number n (2 ≤ n ≤ 100 000)  — number of inflorescences.

Second line of input contains sequence of n - 1 integer numbers p2, p3, ..., pn (1 ≤ pi < i), where pi is number of inflorescence into which the apple from i-th inflorescence rolls down.

Output

Single line of output should contain one integer number: amount of apples that Arcady will be able to collect from first inflorescence during one harvest.

Examples

Input

3
1 1

Output

1

Input

5
1 2 2 2

Output

3

Input

18
1 1 1 4 4 3 2 2 2 10 8 9 9 9 10 10 4

Output

4

Note

In first example Arcady will be able to collect only one apple, initially situated in 1st inflorescence. In next second apples from 2nd and 3rd inflorescences will roll down and annihilate, and Arcady won't be able to collect them.

In the second example Arcady will be able to collect 3 apples. First one is one initially situated in first inflorescence. In a second apple from 2nd inflorescence will roll down to 1st (Arcady will collect it) and apples from 3rd, 4th, 5th inflorescences will roll down to 2nd. Two of them will annihilate and one not annihilated will roll down from 2-nd inflorescence to 1st one in the next second and Arcady will collect it.

题意：

题目有点麻烦，大体意思就是，有一棵苹果树，他在不同的层次上都可能有苹果，如果两个苹果在同一个层次上，这两个苹果就会碎掉，没过一秒钟，各个层次上的苹果就会掉落到下一个层次上

这里输入的 n-1 个数字，是该苹果对应的父节点的层次位置

思路：

这里因为是每个层次的苹果都是同时掉落，所以不同层次的苹果是不可能碰到一起的，所以只需要判断每个层次苹果的奇偶就可以了

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<vector>
#include<cmath>
const int maxn=1e6+5;
typedef long long ll;
using namespace std;
int vis[maxn];
int depth[maxn];
int Max=-1;
int main(){
    int n,tmp;
	scanf("%d",&n);
	depth[1]=1;
	for(int i=2;i<=n;i++){
		scanf("%d",&tmp);
		depth[i]=depth[tmp]+1;
		Max=max(Max,depth[tmp]);
		vis[depth[tmp]]++;
	} 
	int sum=0;
	for(int i=1;i<=Max;i++){
		if(vis[i]%2)
		    sum++;
	}
	printf("%d\n",sum+1);
    return 0;
}

网上还有dfs的版本，其实也就是处理每一层上有多少苹果

#include<iostream>
#include<vector>
using namespace std;
int vis[1000005];
int depth[1000005];
vector<int> v[1000005];
void dfs(int t,int deep){
	depth[t]=deep;
	for(int i=0;i<(int)v[t].size();i++){
		dfs(v[t][i],deep+1);
	}
}
int main(){
	int n;
	scanf("%d",&n);
	depth[1]=1;
	for(int i=2;i<=n;i++){
		int tmp;
		scanf("%d",&tmp);
		v[tmp].push_back(i); 
	}
	dfs(1,0);
	for(int i=1;i<=n;i++)
	    vis[depth[i]]++;
	int sum=0;
	for(int i=1;i<=n;i++){
		if(vis[i]%2)
		    sum++;
	}
	printf("%d\n",sum+1);
	return 0;
}