import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


bool isKadomatsu(int a, int b, int c) {
  return (((a > b && b < c) || (a < b && b > c)) && a != c);
}

int N;
int[] A;

bool solve() {
  int[] js;
  foreach (j; 0 .. N - 2) {
    if (!isKadomatsu(A[j], A[j + 1], A[j + 2])) {
      js ~= j;
    }
  }
  if (js.length > 6) {
    return false;
  }
  int[] ks, ls;
  foreach (j; js) {
    foreach (k; j - 2 .. j + 1) {
      if (0 <= k && k < N) {
        ks ~= k;
      }
    }
    foreach (l; j .. j + 3) {
      if (0 <= l && l < N) {
        ls ~= l;
      }
    }
  }
  ks = ks.sort.uniq.array;
  ls = ls.sort.uniq.array;
  debug {
    writeln("js = ", js);
    writeln("ks = ", ks);
    writeln("ls = ", ls);
  }
  foreach (l0; ls) foreach (l1; ls) {
    if (l0 < l1) {
      swap(A[l0], A[l1]);
      bool ok = true;
      foreach (k; ks) {
        if (!isKadomatsu(A[k], A[k + 1], A[k + 2])) {
          ok = false;
          break;
        }
      }
      swap(A[l0], A[l1]);
      if (ok) {
        return true;
      }
    }
  }
  return false;
}

void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        N = readInt();
        A = new int[N];
        foreach (i; 0 .. N) {
          A[i] = readInt();
        }
        
        const ans = solve();
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}