#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define ll int
#define ull unsigned long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "top1apio"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1ll<<k)
#define checktime   cerr <<  (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
using i128 = __int128;
int rand(int l, int r)
{
    return uniform_int_distribution<int>(l, r)(rd);
}
void phongbeo();
const int inf = 1e17;
const int mod2 = 1e9+7;
//const ll base=67;
ll  n, m, s1, s2, s4, s3, sf, k, s5, s6, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2,
                                                               r2, center;
ll  i, s10, s12, k1, k2, k3, s11, lim, w, l, r, dem5, dem6, dem7, dem9, root,q;
ll el = 19;
main()
{
    ///top1apio
    if (fopen(task2".inp", "r"))
    {
        fin(task2);
        fou(task2);
    }
    ///top1apio
    if (fopen(task".inp", "r"))
    {
        fin(task);
        fou(task);
    }
 
    ///top1apio
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    // cin>>s1;
    ll t=1;
    // cin>>t;
    s10=t;
    while(t--)
        phongbeo();
    ///  checktime
}
int dp[100001][2],dp2[2],dc[2],g[100001][2][2],gg[2][2];
vector<int> v[100001];
int add(int x,int y)
{
    x+=y;
    if(x>=mod2)x-=mod2;
    if(x<0)x+=mod2;
    return x;
}
void dfs(int x)
{
    dp[x][1]=1;
    for(auto f:v[x])
        dfs(f);
    g[x][1][1]=1;
    g[x][1][0]=1;
    for(auto y:v[x])
    {
        dp[y][0]=add(dp[y][0],1);
        for(int f=0; f<=1; f++)
            for(int f2=0; f2<=1; f2++)
            {
                dp2[(f+f2)%2]=add(dp2[(f+f2)%2],dp[x][f]*dp[y][f2]%mod2);
            }
        dp[y][0]=add(dp[y][0],-1);
        ///a la so con
        ///b la con cuoi cung can mau nay
        ///=> con x nhan mau a va co z con
        ///=> con dang sau phai la mau (b+z)%2==a
        for(int f=0; f<=1; f++)
            for(int f2=0; f2<=1; f2++)
            {
                for(int f3=0; f3<=1; f3++)
                {
                    if((f2+f3)%2==f)gg[(f+f3)%2][(f2+f3)%2]=add(gg[(f+f3)%2][(f2+f3)%2],g[x][f][f2]*dp[y][f3]%mod2);
                }
                gg[f][f2]=add(gg[f][f2],g[x][f][f2]);
            }
        for(int f=0; f<=1; f++)
            for(int f2=0; f2<=1; f2++)
                g[x][f][f2]=gg[f][f2],
                            gg[f][f2]=0;
        for(int f=0; f<=1; f++)
            dp[x][f]=dp2[f],dp2[f]=0;
        ///dp[x][0]
    }
    dc[0]=dp[x][0];
    dc[1]=dp[x][1];
    reverse(v[x].begin(),v[x].end());
    dp[x][1]=1;
    dp[x][0]=0;
    for(auto y:v[x])
    {
        dp[y][0]=add(dp[y][0],1);
        for(int f=0; f<=1; f++)
            for(int f2=0; f2<=1; f2++)
            {
                dp2[(f+f2)%2]=add(dp2[(f+f2)%2],dp[x][f]*dp[y][f2]%mod2);
            }
        for(int f=0; f<=1; f++)
            dp[x][f]=dp2[f],dp2[f]=0;
    }
    dp[x][1]=add(dp[x][1],dc[1]);
    dp[x][0]=add(dp[x][0],-g[x][0][1]);
    dp[x][1]=add(dp[x][1],-g[x][1][1]);
    dp[x][0]=add(dp[x][0],dc[0]);
    //dp[x][0]=add(dp[x][0],1);
}
void phongbeo()
{
    cin>>n;
    for(int i=2; i<=n; i++)
        cin>>l,v[l].pb(i);
    dfs(1);
    dp[1][0]=add(dp[1][1],dp[1][0]);
    //dp[1][0]--;
    cout<<(dp[1][0]+mod2)%mod2;
}