#include <iostream>
#include <vector>
#include <utility>
using namespace std;

bool isKadomatu(const vector<int>& v){
    for(int i = 1; i < v.size() - 1; ++i){
        if((v[i-1] < v[i] && v[i+1] < v[i]) || (v[i-1] > v[i] && v[i+1] > v[i])){
            continue;
        }else{
            return false;
        }
    }
    return true;
}

int main(){
    int t;
    cin >> t;
    
    for(int i = 0; i < t; ++i){
        int n;
        cin >> n;
        vector<int> v(n);
        for(int j = 0; j < n; ++j){
            cin >> v[j];
        }
        bool found = false;
        for(int j = 0; j < n-1; ++j){
            for(int k = j+1; k < n; ++k){
                swap(v[j], v[k]);
                if(isKadomatu(v)){
                    found = true;
                    break;
                }
                swap(v[j], v[k]);
            }
            if(!found){
                break;
            }
        }
        if(found){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
    }
    
    return 0;
}