Hula's Cardgame

Geunsu and Seunghyeong want to play Hula's Cardgame at K512. K512 has $N$ tables, numbered from $1$ to $N$. Each table has 3 cards, and each card on table $i$ holds an integer from $i$ to $N$, inclusive.

Geunsu and Seunghyeong are at table $1$ now. Table $E$ has a Umaru Doma doll that Geunsu likes, so Geunsu wants to go to table $E$. Seunghyeong dislikes this and does not want to go to table $E$. They repeat the following steps until the game ends.

1. If the current table is table $E$, Geunsu wins.
2. If the current table is not table $E$, Seunghyeong removes one of the 3 cards on the current table.
3. Geunsu picks one of the 2 remaining cards on the current table. They move to the table whose number is the integer on that card. If the integer on the chosen card equals the current table number, meaning they revisit a table they have already visited, Seunghyeong wins.

Assume both play optimally. Geunsu wants to know whether he can win. Solve this for every $E$ with $1 \le E \le N$.

The first line contains the number of tables $N$. ($1 \le N \le 2\times10^5$)

From the second line to the $(N+1)$th line, the integers $a_i$, $b_i$, $c_i$ on the 3 cards of each table are given, separated by spaces. The $j$th line gives the 3 integers on the cards of table $j-1$. ($i \le a_i, b_i, c_i \le N$)

On the $i$th line, print Yes if Geunsu can win when $E = i$, and No if he loses.