CF1057A.Bmail Computer Network

Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given the values $p_i$ — the index of the router to which the $i$-th router was connected after being purchased ($p_i \lt i$).

There are $n$ routers in Boogle in total now. Print the sequence of routers on the path from the first to the $n$-th router.

从前，在著名的公司 Bmail 中只有一台路由器。多年过去，随着时间推移，他们陆续购置了新的路由器。每次购买一台新路由器时，都会将其连接到之前已购入的某一台路由器上。现给出数组 $p_i$ —— 表示第 $i$ 台路由器在购入后所连接的路由器编号（满足 $p_i \lt i$）。

目前 Boogle 公司共有 $n$ 台路由器。请输出从第 $1$ 台路由器到第 $n$ 台路由器的路径上的路由器序列。

The first line contains integer number $n$ ($2 \le n \le 200000$) — the number of the routers. The following line contains $n-1$ integers $p_2, p_3, \dots, p_n$ ($1 \le p_i \lt i$), where $p_i$ is equal to index of the router to which the $i$-th was connected after purchase.

第一行包含一个整数 $n$（$2 \le n \le 200000$）—— 路由器的数量。
接下来的一行包含 $n-1$ 个整数 $p_2, p_3, \dots, p_n$（$1 \le p_i \lt i$），其中 $p_i$ 表示第 $i$ 个路由器在购买后所连接的路由器的编号。

Print the path from the $1$-st to the $n$-th router. It starts with $1$ and ends with $n$. All the elements in the path should be distinct.

输出从第 $1$ 个路由器到第 $n$ 个路由器的路径。该路径以 $1$ 开始，以 $n$ 结束，且路径中所有元素互不相同。