Two Increasings - Repovive Opening Round | Repovive

0F. Two Increasings

3000 pts2s256 MB

You are given a permutation of length $2n$ . You should determine whether we can divide it into two increasing subsequences of length $n$ , or not.

Constraints

t \\[0.5em] \left. \begin{array}{l} n \\ p_1 \quad p_2 \quad \cdots \quad p_{2n} \end{array} \right\} \times t

\begin{array}{l} ans_1 \\ \vdots \\ ans_t \end{array}

Where each answer is "Yes" or "No".

Input

4
3
1 2 3 4 5 6
3
5 1 2 3 4 6
3
2 1 4 3 6 5
3
4 2 1 3 5 6

Explanation

Sample test case with 4 sub-tests

Output

Yes
No
Yes
No

You are given a permutation of length $2n$ . You should determine whether we can divide it into two increasing subsequences of length $n$ , or not.

t \\[0.5em] \left. \begin{array}{l} n \\ p_1 \quad p_2 \quad \cdots \quad p_{2n} \end{array} \right\} \times t

\begin{array}{l} ans_1 \\ \vdots \\ ans_t \end{array}

Where each answer is "Yes" or "No".