#include <bits/stdc++.h>
using namespace std;
const int MOD = 119 << 23 | 1;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-12;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int myrand() { return abs((int)mt()); }
void chemthan() {
  int n;
  cin >> n;
  vector<vector<int> > adj(n);
  for (int i = (1); i < (n); ++i) {
    int p;
    cin >> p;
    p--;
    adj[p].push_back(i);
  }
  vector<vector<int> > dp(n, vector<int>(2));
  function<void(int)> dfs = [&](int u) {
    dp[u][0] = 1, dp[u][1] = 0;
    if (!int((adj[u]).size())) {
      dp[u][1] = 1;
      return;
    }
    int k = int((adj[u]).size());
    vector<int> pref, suff;
    int tmp = 1;
    for (int v : adj[u]) {
      dfs(v);
      dp[u][0] = mult(dp[u][0], dp[v][0] + dp[v][1]);
      tmp = mult(tmp, dp[v][0]);
      pref.push_back(dp[v][0]);
      suff.push_back(dp[v][0]);
    }
    for (int i = (1); i < (k); ++i) pref[i] = mult(pref[i], pref[i - 1]);
    for (int i = (k - 1) - 1; i >= (0); --i)
      suff[i] = mult(suff[i], suff[i + 1]);
    for (int i = (0); i < (k); ++i) {
      int v = adj[u][i];
      int t = dp[v][1];
      if (i) t = mult(t, pref[i - 1]);
      if (i + 1 < k) t = mult(t, suff[i + 1]);
      addmod(dp[u][1], t);
      submod(dp[u][0], t);
    }
    int x = dp[u][0];
    submod(x, tmp);
    addmod(dp[u][1], x);
  };
  dfs(0);
  cout << dp[0][0] << "\n";
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
