swap-1
Source: hackerearth
Difficulty: EASY

Given an array A of N elements. Print Yes if you can make array in non-decreasing order by performing at most 1 swap else print No.

Input
First line contains T (number of test cases). First line of each test case contains N (number of elements in array). Next line contains N integers separated by a single space.
Constraints
1 ≤ T ≤ 100
1 ≤ N ≤ 10^5
1 ≤ Ai ≤ 10^9

SAMPLE INPUT
3
4
1 2 3 4
3
3 2 1
3
3 1 2

SAMPLE OUTPUT
Yes
Yes
No