#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e) { cerr << e << endl; } template void debug(vector &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector &vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector> &vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } int main() { ll Q; cin >> Q; while (Q--){ ll N; cin >> N; vector P(N); rep(i, N){ cin >> P[i]; } // 向き付けのルールは、「1 の両隣の大小が小さいほうを先頭」とする // 1 を 2 番目において、その区間を反転させるようにする // そうすれば逆転しても大丈夫 // 選ばれなかったほうの区間の左右の大小に応じて、どちらを裏返すかを決める // (3, 2, 1, 4, 5, 6) <-> (2, 1, 4, 5, 6, 3) <-> (4, 1, 2, 5, 6, 3) // (2, 1, 4, 3, 6, 5) <-> (2, 1, 4, 5, 6, 3) <-> (3, 2, 1, 4, 5, 6) で元に一致 ll inv_1 = -1; rep(i, N){ if (P[i] == 1) inv_1 = i; } if (P[(inv_1 + 1) % N] < P[(inv_1 + N - 1) % N]){ // 順方向 ll targ = (inv_1 + N - 1) % N; if (P[(targ + N / 2) % N] < P[(targ + N - 1) % N]){ cout << targ << endl; } else{ cout << (targ + N / 2) % N << endl; } } else{ ll targ = (inv_1 + 1) % N; if (P[(targ + 1) % N] > P[(targ + N / 2) % N]){ cout << (targ + N / 2 + 1) % N << endl; } else{ cout << (targ + 1) % N << endl; } } } }