#include<bits/stdc++.h>
using namespace std;
vector<int>G[1<<17];
const int mod=998244353;
int dfs(int u,int d){
  int res=1;
  for(int v:G[u])res=(long)res*dfs(v,d+1)%mod;
  if(d>=2)res++;
  return res;
}
int main(){
  int n;
  scanf("%d",&n);
  for(int i=1;i<n;i++){
    int p;
    scanf("%d",&p);
    p--;
    G[p].push_back(i);
  }
  printf("%d\n",dfs(0,0));
}