Pseudo Sorted Array

An array $A$ of length $N$ is said to be *pseudo-sorted* if it can be made non-decreasing after performing the following operation **at most once**. - Choose an $i$ such that $1 \le i \leq N-1$ and swap $A_i$ and $A_{i+1}$ Given an array $A$, determine if it is *pseudo-sorted* or not. ### Input - The first line contains a single integer $T$ - the number of test cases. Then the test cases follow.