Central Cutting

*This problem has subtasks.* Given an array $A$, you can perform the following operation on it: - Choose three indices $i, j, k$ such that $1 \leq i \lt j \lt k \leq |A|$ and $A_i \lt A_j \lt A_k$, and delete $A_j$. That is, choose an increasing subsequence of length $3$ in $A$ and delete its middle element. $|A|$ denotes the length of $A$, which reduces by $1$ after the operation is performe