Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Random Function and Tree

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou have a rooted tree consisting of *n* vertices. Let's number them with integers from 1 to *n* inclusive. The root of the tree is the vertex 1. For each *i* > 1 direct parent of the vertex *i* is *p*_{i}. We say that vertex *i* is child for its direct parent *p*_{i}.

You have initially painted all the vertices with red color. You like to repaint some vertices of the tree. To perform painting you use the function paint that you call with the root of the tree as an argument. Here is the pseudocode of this function:

count = 0 // global integer variable

rnd() { // this function is used in paint code

return 0 or 1 equiprobably

}

paint(s) {

if (count is even) then paint s with white color

else paint s with black color

count = count + 1

if rnd() = 1 then children = [array of vertex s children in ascending order of their numbers]

else children = [array of vertex s children in descending order of their numbers]

for child in children { // iterating over children array

if rnd() = 1 then paint(child) // calling paint recursively

}

}

As a result of this function, some vertices may change their colors to white or black and some of them may remain red.

Your task is to determine the number of distinct possible colorings of the vertices of the tree. We will assume that the coloring is possible if there is a nonzero probability to get this coloring with a single call of *paint*(1). We assume that the colorings are different if there is a pair of vertices that are painted with different colors in these colorings. Since the required number may be very large, find its remainder of division by 1000000007 (10^{9} + 7).

Input

The first line contains a single integer *n* (2 ≤ *n* ≤ 10^{5}) — the number of vertexes in the tree.

The second line contains *n* - 1 integers *p*_{2}, *p*_{3}, ..., *p*_{n} (1 ≤ *p*_{i} < *i*). Number *p*_{i} is the parent of vertex *i*.

Output

Print a single integer — the answer to the problem modulo 1000000007 (10^{9} + 7)

Examples

Input

4

1 2 1

Output

8

Input

3

1 1

Output

5

Note

All possible coloring patterns of the first sample are given below.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/16/2021 21:36:25 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|