#include <bits/stdc++.h>
using namespace std;

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
ostream &operator<<(ostream &os, const mint &p) { return os << p.val(); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    V<int> p(N);
    rep(i, N - 1) {
        cin >> p[i + 1];
        p[i + 1]--;
    }
    show(p);
    V<V<int>> G(N);
    for (int i = 1; i < N; i++) {
        G[i].push_back(p[i]);
        G[p[i]].push_back(i);
    }
    V<V<mint>> dp(N, V<mint>(2, 1));
    auto rec = [&](auto f, int cur, int par) -> void {
        if (G[cur].size() == 1) return;
        for (auto &nx : G[cur]) {
            if (nx == par) continue;
            f(f, nx, cur);
            dp[cur][1] *= (dp[nx][0] + dp[nx][1]);
            dp[cur][0] *= dp[nx][0];
        }
        dp[cur][1] -= dp[cur][0];
    };
    mint ans = 1;
    for (auto &v : G[0]) {
        rec(rec, v, 0);
        ans *= dp[v][0] + dp[v][1];
    }
    cout << ans << '\n';
    show(dp);
    show(G);
    return 0;
}