Mascot Song

Fuleco writes a song as a sequence $A_1, \ldots, A_n$. A consecutive subarray $A_i, \ldots, A_j$ ($1 \le i \le j \le n$) is a block when:

• $i=1$ or $A_i \le A_{i-1}$
• $j=n$ or $A_j \ge A_{j+1}$
• $A_i < A_{i+1} < \cdots < A_j$

Every element belongs to exactly one block.

You get the starting sequence and $q$ queries:

• 1 x y: set $A_x \leftarrow y$
• 2 z: rotate the whole sequence left by $z$ (the first element wraps to the end)

After each query, print the current number of blocks.

Line 1: $n$.

Line 2: $A_1, \ldots, A_n$.

Line 3: $q$.

Next $q$ lines: queries (1 x y or 2 z).

Print the block count after each query, one per line in order.

$2 \le n \le 200\,000$, $1 \le A_i \le 10^9$, $1 \le q \le 200\,000$.