SOLVE
LATER
Alakazam has the unique ability to teleport itself during fights. He has realized that he can use this ability not just in Poke'mon fights, but also during real time manipulation of arrays. Abra, his non-evolution form has an interesting array of $$N$$ integers, A_{1}, A_{2}, ... , A_{N-1}, A_{N}.
Since, Alakazam wants to try his teleporation power on arrays too, he decides to formalize it: he can move from any position $$i$$ to a position $$A[i]$$ in any array of the world. Now, he is currently standing at a position he calls $$S$$. He wants you to figure out if he can reach the position $$E$$.
Input format:
The first line consists of a single integer $$N$$. The second line consists of $$N$$ integers A_{1}, A_{2}, ... , A_{N-1}, A_{N}, which are separated by a space. The next line consists of two integers $$S$$ and $$E$$.
Output format:
Print Yes
if he can reach the position $$E$$ starting from position $$S$$, else print No
.
Constraints:
1 ≤ $$N$$ ≤ 1000
1 ≤ $$A$$_{i} ≤ N
1 ≤ $$S$$, $$E$$ ≤ N
Reference:
From 1, he can go to 3 since A[1]=3.
From 3, he can go to 2 since A[3]=2.
From 2, he can go to 4 since A[2]=4.