Ruby is the Minister of Railways of Code-Land. She has been given a map of the train routes between N stations (S₁ S₂ S₃ ... S_N). The map contains information about all the direct routes that exits between a pair of stations, and there exists at most one outgoing route from any station S_j. If a route exists between stations S_j and S_k, then the train can only travel from S_j to S_k.

Ruby has decided to improve the railway channel and accepts Q queries based on administrative evaluation.

• Query 1 X is to remove the railway link originating from station X if exist and make it terminal.
• Query 2 X is to report the terminal station that can be reached if starting at station X.

INPUT FORMAT :

• The first line contains the integer N.
• The second line contains N space separated integers A₁ A₂ A₃.... A_N. The i^th integer A_i represent that there exist a direct link from station S_i to station A_i  and so on. If A_i = -1 then it signifies that no outgoing link exists from station S_i  i.e station S_i is terminal.
• The third line contains the single integer Q.
• The following Q lines contain the query of form 1 X or 2 X

OUTPUT FORMAT :

• For each query of the form 2 X, print the terminal (last) station that can be reached from station X.
• If no terminal station exists(this means there exist a loop)  then print LOOP.

Constraints:

• 0<=Q<=10⁶
• 1<=N<=10⁶
• 1<=X<=N