#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'
#define rev_str(str) reverse(str.begin(),str.end());
#define all(x) x.begin(), x.end()
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;

void solve() {
    int n; cin >> n;
    vector<int>p(n),q,s,check,jjk;
    for(int i = 0; i <n ; i++) {
        cin >> p[i];
    }
    ll idx = 0;
    bool ok = false;
    for(int i = 1; i < n ; i++) {
        if(p[i] > p[i-1] && !ok){
            idx = i;
        }
        else{
            ok = true;
            q.push_back(p[i]);
        }
    }
    check = q;
    rev_str(check);
    if(!check.empty()){
       if(is_sorted(all(check))) {
          cout << "YES" << endl;return;
        }
    }
    ok = false;
    ll index = 0;
    for(int i = 1; i < n; i++) {
        if(p[i] < p[i-1] && !ok) {
            index = i;
        }
        else{
            ok = true;
            s.push_back(p[i]);
            //cout << p[i] <<' ';
        }
    }
    if(!s.empty()){
        if(is_sorted(all(s))) {
           cout << "YES" << endl;return;
        }
    }

    cout <<"NO" << endl;

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1; cin >> t;
    while(t--){
        solve();
    }
    return 0;
}