Concat Sort

JJ has an array $A$. He can perform the following operation on $A$: - Divide $A$ into two subsequences $P$ and $Q$ such that each $A_i$ belongs to either $P$ or $Q$. - Set $A := P\ \texttt{concat}\ Q$ Here $\texttt{concat}$ denotes the concatenation operation. For e.g. $[2, 1, 5] \texttt{ concat } [4, 3] = [2, 1, 5, 4, 3]$. Is it possible to make $A$ sorted in non-decreasing order after applyi