#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize(2)
using namespace std;
int n, f[1000006], g[1000006];
// f: ab
//g :b
vector<int> son[1000005];
const int mod = 998244353;
inline void dfs(int p) {
	g[p] = f[p] = 1;
	int u, v;
	for (int i : son[p]) {
		dfs(i);
		u = f[p], v = g[p];
		f[p] = ((f[i] + g[i]) * u % mod + v * f[i] % mod) % mod;
		g[p] = v * (g[i] + f[i]) % mod;
//		cout << i << ' ' << p << " " << f[p] << " " << g[p] << "\n";
	}
//	cout << p << " " << f[p] << " " << g[p] << "\n";
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	int p;
	for (int i = 2; i <= n; i++) {
		cin >> p;
		son[p].push_back(i);
	}
	dfs(1);
	cout << f[1];
}