#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=144494;
ll mod=998244353;
int main(){
    ll  n;
    cin >> n;
    if (n==1)
    {
        cout << 1 << endl;
        return 0;
    }
    
    vector<vector<ll>>g(n);
    for (ll i = 0; i < n-1; i++)
    {
        ll a;
        cin >> a;
        a--;
        g[a].push_back(i+1);
    }
    vector<ll>memo(n,inf);
    memo[0]=0;
    queue<ll>que;
    que.push(0);
    while (!que.empty())
    {
        ll v=que.front();
        que.pop();
        for (ll i = 0; i < g[v].size(); i++)
        {
            if (memo[g[v][i]]>memo[v]+1)
            {
                memo[g[v][i]]=memo[v]+1;
                que.push(g[v][i]);
            }
        }
    }
    ll ans=1;
    for (ll i = 0; i < n; i++)
    {
        bool ok=true;
        for (ll j = 0; j < g[i].size(); j++)
        {
            if (memo[g[i][j]]>memo[i])
            {
                ok=false;
                break;
            }
        }
        if (ok)
        {
            ans*=memo[i];
            ans%=mod;
        }
    }
    cout << ans << endl;
}