#include <bits/stdc++.h>

using namespace std;

vector<string> split_string(string);

bool isValid(vector<int> a) {
    for (int i = 0; i < (int)a.size() - 1; ++i) {
        if (a[i] > a[i+1]) {
            return false;
        }
    }
    return true;
}
    
/*
 * Complete the canModify function below.
 */
string canModify(vector<int> a) {
    if (a.size() == 1) {
        return "YES";
    }
    for (int toReplace = 0; toReplace < a.size(); ++toReplace) {
        for (int val = 1; val <= 2000; ++val) {
            int temp = a[toReplace];
            a[toReplace] = val;
            if (isValid(a)) {
                return "YES";
            }
            a[toReplace] = temp;
        }
    }
    return "NO";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t; cin >> t;
    while (t--) {
        int n; cin >> n;
        vector<int> a(n, 0);
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }
        cout << canModify(a) << endl;
    }
    return 0;
}

vector<string> split_string(string input_string) {
    string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
        return x == y and x == ' ';
    });

    input_string.erase(new_end, input_string.end());

    while (input_string[input_string.length() - 1] == ' ') {
        input_string.pop_back();
    }

    vector<string> splits;
    char delimiter = ' ';

    size_t i = 0;
    size_t pos = input_string.find(delimiter);

    while (pos != string::npos) {
        splits.push_back(input_string.substr(i, pos - i));

        i = pos + 1;
        pos = input_string.find(delimiter, i);
    }

    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

    return splits;
}