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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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)); }




void main() {
  const Q = readInt;
  foreach (q; 0 .. Q) {
    const N = readInt;
    auto P = new int[N];
    foreach (i; 0 .. N) P[i] = readInt;
    
    int rot = -1;
    foreach (i; 0 .. N) if (P[i] == 1) rot = i;
    P = P[rot .. N] ~ P[0 .. rot];
    
    int ans;
    // ? in : out
    if (P[1] > P[N - 1]) {
      ans = (P[N - 2] > P[N - (N/2 + 1)]) ? (N - (N/2 + 1)) : (N - 1);
    } else {
      ans = (P[2] > P[N/2 + 1]) ? 2 : (N/2 + 2);
    }
    
    ans = (rot + ans) % N;
    writeln(ans);
    stdout.flush;
  }
}