Killjee has an array a containing n integers $a_{i}$.

Now he has Q queries of two types

1 u val change $a_u$ to $val$

2 u v val - check If val exist in subarray starting at index u and ending at index v.

INPUT

First Line of Input contain a single integer N.

Next line contains n space separated integres elements of array a.

Next Line Contains q number of queries.

Next q line queries as speciied in problem.

OUTPUT

For each query if val exist print $YES$ else print $NO$

CONSTRAINTS

$n \le 10^{5}$

$a_{i} \le 1000$

$1 \le q \le 5*10^6$