def 🎍(a,b,c)
    a != c && ((a < b && b > c) || (a > b && b < c))
end

# - - - - -

def solve(n, arr)
    
    not_kado_idxs = arr.each_cons(3).each_with_index.map{|a,i| 🎍(*a) ? nil : i}.compact
    
    return false if not_kado_idxs.size > 20
    
    not_kado_elem_idxs = not_kado_idxs.map{|i| [i, i+1, i+2]}.flatten.uniq
    validate_idxs = not_kado_idxs.map{|i| (-3..2).map{|e|i+e}.to_a}.flatten.uniq.select{|i| 0 <= i && i < n-2}
    
    ok = false
    n.times do |i|
        ii = (-3..2).map{|e|i+e}.select{|i| 0 <= i && i < n-2}
        not_kado_elem_idxs.each do |j|
            next if i == j
            arr[i], arr[j] = arr[j], arr[i]
            ok ||= validate_idxs.each.all?{|x| 🎍(arr[x], arr[x+1], arr[x+2])} &&
                   ii.all?{|x| 🎍(arr[x], arr[x+1], arr[x+2])}
            arr[i], arr[j] = arr[j], arr[i]
        end
    end
    ok
end



line1 = gets.chomp!
abort unless line1 =~ /^\d+$/

t = line1.to_i

n_total = 0

t.times do |i|
  linea = gets.chomp!
  lineb = gets.chomp!
  abort "#{i}: n format" unless linea =~ /^\d+$/
  abort "#{i}: A format" unless lineb =~ /^\d+(?: \d+)+$/
  
  n = linea.to_i
  arr = lineb.split.map(&:to_i)
  n_total += n
  
  abort "#{i}: n"    unless n == arr.size 
  abort "#{i}: A[i]" unless arr.all?{|a| 1 <= a && a <= n}
  abort "#{i}: 🎍" if arr.each_cons(3).all?{|a| 🎍(*a)}
  puts solve(n, arr) ? 'Yes' : 'No'
end
abort 'break' if gets

abort 'n_total' unless n_total <= 50000