import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998_244_353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); } void main() { bool f(long[] arr) { return (arr[0] != arr[2]) && ((arr[0] < arr[1] && arr[2] < arr[1]) || (arr[0] > arr[1] && arr[2] > arr[1])); } auto T = RD; auto ans = new bool[](T); foreach (ti; 0..T) { auto N = RD; auto A = RDA; bool[long] index; long cnt; foreach (i; 1..N-1) { if (!f(A[i-1..i+2])) { index[i-1] = true; index[i] = true; index[i+1] = true; ++cnt; } } debug writeln("cnt:", cnt); debug writeln("index:", index); if (cnt > 6) continue; long g(long[] list) { long res; foreach (i; list) { if (!f(A[i-1..i+2])) ++res; } return res; } (){ foreach (i; index.keys) { bool[long] set; foreach (j; max(1, i-1)..min(i+2, N-1)) set[j] = true; foreach (j; 0..N) { if (i == j) continue; auto set2 = set.dup; foreach (k; max(1, j-1)..min(j+2, N-1)) set2[k] = true; auto cnt0 = g(set2.keys); debug writeln("i:", i, " j:", j, " set2:", set2); if (cnt0 != cnt) continue; swap(A[i], A[j]); auto cnt1 = g(set2.keys); swap(A[i], A[j]); if (cnt1 == 0) { ans[ti] = true; return; } } }}(); } foreach (e; ans) writeln(e ? "Yes" : "No"); stdout.flush; debug readln; }