#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<double,double> pd;

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const double PI = 4*atan(1);
const ll INF = 1e18;
const int MX = 100001;

int T;

void solve() {
    int N; cin >> N;
    vi v(N);
    F0R(i,N) cin >> v[i];
    vi bad;
    F0R(i,N-1) if (v[i] > v[i+1]) bad.pb(i);
    if (sz(bad) == 0) cout << "YES\n";
    else if (sz(bad) == 1) {
        if (bad.front() == 0 || v[bad.front()-1] <= v[bad.front()+1]) cout << "YES\n";
        else if (bad.front() == N-2 || v[bad.front()] <= v[bad.front()+2]) cout << "YES\n";
        else cout << "NO\n";
    } else if (bad.front()+1 == bad.back() && v[bad.front()] <= v[bad.back()+1]) cout << "YES\n";
    else cout << "NO\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> T;
    F0R(i,T) solve();
}

// read the question correctly (is y a vowel?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)