#include<bits/stdc++.h>
using namespace std;
const int N = 1e7+10;
#define ll long long
const long long mod = 998244353;
int n;
ll sz[N],ans;
vector<int> g[N];
char ch;
inline int read(){
    int res=0;
    ch=getchar();
    while(!(ch>='0'&&ch<='9'))  ch=getchar();
    while((ch>='0'&&ch<='9'))
        res=(res<<3)+(res<<1)+ch-'0',ch=getchar();
    return res;
}
inline ll kpow(ll a,ll b){
    ll base=a,ret=1;
    while(b){
        if(b&1) ret=ret*base%mod;
        base=base*base%mod;
        b>>=1;
    }
    return ret%mod;
}
void dfs(int u,int dep){
    if(g[u].size()==0){
        sz[u]=1;
        ans+=kpow(sz[u],mod-2);
        return ;
    }
    for(int i=0;i<g[u].size();++i){
        dfs(g[u][i],dep+1);
        sz[u]+=sz[g[u][i]];
    }
    sz[u]++;
    ans+=kpow(sz[u],mod-2);
    ans%=mod;
}
int main(){
    cin>>n;
    for(int i=2,x;i<=n;++i)
        x=read(),g[x].push_back(i);
    dfs(1,1);
    cout<<ans<<endl;
    return 0;
}