mod = 998244353


def main():
    import sys
    input = sys.stdin.readline
    from collections import deque

    N = int(input())
    if N == 1:
        print(1)
        exit()
    adj = [[] for _ in range(N + 1)]
    for v in range(2, N + 1):
        p = int(input())
        adj[v].append(p)
        adj[p].append(v)

    que = deque()
    que.append(1)
    seen = [-1] * (N+1)
    seen[1] = 0
    par = [0] * (N+1)
    child = [[] for _ in range(N+1)]
    seq = []
    while que:
        v = que.popleft()
        seq.append(v)
        for u in adj[v]:
            if seen[u] == -1:
                seen[u] = seen[v] + 1
                par[u] = v
                child[v].append(u)
                que.append(u)
    seq.reverse()

    dp = [0] * (N + 1)
    for v in seq:
        if v == 1:
            print(dp[1])
        else:
            p = par[v]
            if not child[v]:
                dp[v] = 1
                dp[p] = (dp[p] + dp[v])%mod
            else:
                dp[p] = (dp[p] + dp[v] * 2)%mod


if __name__ == '__main__':
    main()