def oi(): return int(input())
def os(): return input()
def mi(): return list(map(int, input().split()))

# import sys
# input = sys.stdin.readline
# import sys
# sys.setrecursionlimit(10**8)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input_count = 0

mod = 998244353
input_count = 0
N = oi()
NODE = N
LOOP_NUM = N-1
maps = {i:[] for i in range(NODE)}
num = 2
for i in range(LOOP_NUM):
    parent = oi()
    maps[num-1].append(parent-1)
    maps[parent-1].append(num-1)
    num += 1
from collections import deque
reached = [-1] * N ## 1つ前のノードを持たせると微妙に遅くなるのでやめよう
deq = deque([[0,0]])

while deq:

    node, num = deq.popleft() #BFS
    reached[node] = num

    for next_node in maps[node]:
        # 訪問済み判定
        if reached[next_node] != -1:
            continue

        reached[next_node] = num+1
        deq.append([next_node,num+1])
        

out = 1
from collections import Counter
for k, v in Counter(reached).items():
    if k==0:
        continue
    out = (out * pow(k, v, mod))%mod
print(out)