#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
const int N = 1e3 + 10;
int p[N], q[N], len; vector<pair<int, int> > R;
vector<int> calc(vector<int> P, int x, int y) {
    vector<int> R;
    for(int i = y; i >= 1; i--)
        R.emplace_back(P[P.size() - i]);
    for(int i = x; i < P.size() - y; i++) R.emplace_back(P[i]);
    for(int i = 0; i < x; i++) R.emplace_back(P[i]);
    return R;
}
vector<int> wrk(vector<int> P, int x, int y) {
    int a = 0, b = 0;
    for(int i = 0; i < x; i++) a += P[i];
    for(int i = P.size() - y; i < P.size(); i++) b += P[i];
    int tot = 0;
    for(int i = len - b + 1; i <= len; i++) q[++tot] = p[i];
    for(int i = a + 1; i <= len - b; i++) q[++tot] = p[i];
    for(int i = 1; i <= a; i++) q[++tot] = p[i];
    for(int i = 1; i <= len; i++) p[i] = q[i];
    R.emplace_back(a, b); return calc(P, x, y);
}
int main() {
    //file("");
    int n = 4; map<vector<int>, vector<pair<int, int> > > G;
    vector<int> B;
    for(int i = 1; i <= n; i++)
        B.emplace_back(i);
    G[B] = {}; queue<vector<int> > q; q.push(B);
    while(!q.empty()) {
        auto T = q.front(); q.pop();
        const auto S = G[T];
        for(int x = 1; x < n; x++)
            for(int y = 1; x + y < n; y++) {
                auto C = calc(T, x, y);
                if(G.find(C) == G.end()) {
                    G[C] = S; G[C].emplace_back(x, y);
                    q.push(C);
                }
            }
    }
    int T; read(T);
    while(T--) {
        read(len);
        for(int i = 1; i <= len; i++) read(p[i]);
        if(len == 3) {
            if(p[1] > p[3]) cout << 1 << '\n' << 1 << ' ' << 1 << '\n';
            else puts("0"); continue;
        }
        R.clear();
        if(p[1] != 1) {
            vector<int> T; vector<pair<int, int> > op;
            if(p[2] == 1) op = G[{2, 1, 4, 3}], T = {1, 1, 1, len - 3};
            else if(p[len] == 1) op = G[{4, 2, 3, 1}], T = {1, 1, len - 3, 1};
            else {
                int id = 0;
                for(int i = 2; i <= len; i++) if(p[i] == 1) id = i;
                op = G[{3, 1, 2, 4}], T = {1, id - 2, 1, len - id};
            }
            for(auto i : op) T = wrk(T, i.first, i.second);
        }
        for(int i = 2; i <= len - 2; i++) {
            int id = 0;
            for(int j = i; j <= len; j++)
                if(p[j] == i) id = j;
            vector<int> T; vector<pair<int, int> > op;
            if(id == i) continue;
            else if(id == len) op = G[{1, 4, 2, 3}], T = {i - 1, 1, len - i - 1, 1};
            else op = G[{1, 3, 4, 2}], T = {i - 1, id - i, 1, len - id};
            for(auto i : op) T = wrk(T, i.first, i.second);
        }
        if(p[len] != len) {
            vector<int> T = {len - 3, 1, 1, 1}; auto op = G[{1, 2, 4, 3}];
            for(auto i : op) T = wrk(T, i.first, i.second);
        }
        cout << R.size() << '\n';
        for(auto i : R) cout << i.first << " " << i.second << '\n';
     }
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}