Problem Statement

Takahashi and Aoki will play a game using a rooted tree with $n$ vertices, numbered $1$ through $n$. The root of the tree is Vertex $1$. For each $v=2,\dots,n$, the parent of Vertex $v$ is $p_v$. Initially, there is one coin on each vertex. Additionally, there is a piece on Vertex $1$.

Takahashi and Aoki will alternately do the following operation, with Takahashi going first:

• If there is a coin on the vertex occupied by the piece: get the coin and end his turn.
• If there is no coin on the vertex occupied by the piece: move the piece (or end the game) as follows.
• If there are vertices with coins on them among the children of the vertex occupied by the piece, choose one such vertex, move the piece to that vertex, and end his turn.
  • Otherwise, if the piece is on the root, end the game; if not, move the piece to the parent of the vertex occupied by the piece and end his turn.

Both Takahashi and Aoki will play optimally to maximize the number of coins they will get. Find the number of coins Takahashi will get.

Constraints

• $2\le n \le 10^5$
• $1\le p_v \lt v$

Input

Input is given from Standard Input in the following format:

n
p_2 \dots p_n

Output

Print the number of coins Takahashi will get when the two players play optimally.