from random import shuffle, seed
seed(43)
def main():
    n = int(input())
    P = list(map(lambda x: int(x)-1, input().split()))
    I = [i for i in range(n)]
    shuffle(I)
    P = [I[p] for p in P]
    s0 = s1 = -1
    for i in range(n):
        if P[i] == 0:
            s0 = i
        if P[i] == 1:
            s1 = i
    m = n//2
    if m % 2:
        if (s0+m)%n == s1:
            i = (s0-m//2)%n
            l0, r0 = P[i], P[(i+m-1)%n]
            l1, r1 = P[(i+m)%n], P[(i-1)%n]
        else:
            f = 0
            for i in range(s0, s0+m):
                i %= n
                if P[i] == 1:
                    f = 1
            if f:
                i = s0
                l0, r0 = P[s0], P[(s0+m-1)%n]
                l1, r1 = P[(s0+m)%n], P[s0-1]
            else:
                i = (s0-m+1)%n
                l0, r0 = P[(s0-m+1)%n], P[s0]
                l1, r1 = P[(s0+1)%n], P[(s0+m)%n]
        if (l0-r0)*(l1-r1) > 0:
            return i+1
        else:
            return (i+m)%n+1
    else:
        if (s0+m)%n == s1:
            assert 0
        else:
            f = 0
            for i in range(s0, s0+m):
                i %= n
                if P[i] == 1:
                    f = 1
            if f:
                i = s0
                l0, r0 = P[s0], P[(s0+m-1)%n]
                l1, r1 = P[(s0+m)%n], P[s0-1]
            else:
                i = (s0-m+1)%n
                l0, r0 = P[(s0-m+1)%n], P[s0]
                l1, r1 = P[(s0+1)%n], P[(s0+m)%n]
        if (l0-r0)*(l1-r1) > 0:
            return i+1
        else:
            return (i+m)%n+1

for _ in range(int(input())):
    print(main())