#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

int n;
vector<int> t;
vector<vector<int>> answer;
vector<vector<int>> cycles;

void generateCycles() {
    vector<int> a = t;
    sort(a.begin(), a.end());
    map<int, int> m;
    for (int i = 0; i < a.size(); i++) {
        m[a[i]] = i;
    }
    vector<bool> proc(n);
    for (int i = 0; i < n; i++) {
        if (!proc[i]) {
            int start = i;
            proc[i] = true;
            if (m[t[i]] == i) {
            }
            else {
                vector<int> cycle;
                cycle.push_back(i);
                int pos = m[t[i]];
                while (pos != start) {
                    proc[pos] = true;
                    cycle.push_back(pos);
                    pos = m[t[pos]];
                }
                cycles.push_back(cycle);
            }
        }
    }
}

void generateRound() {
    vector<int> front, back;
    for (int i = 0; i < cycles.size(); i++) {
        for (int j = 0; j + 1 < cycles[i].size(); j += 2) {
            front.push_back(cycles[i][j]);
            back.push_back(cycles[i][j + 1]);
        }
    }
    for (int i = 0; i < front.size(); i++){
        swap(t[front[i]], t[back[i]]);
    }
    reverse(back.begin(), back.end());
    front.insert(front.end(), back.begin(), back.end());
    answer.push_back(front);
}

int main() {
    cin >> n;
    t.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
    }
    do {
        cycles.clear();
        generateCycles();
        generateRound();
    } while (!cycles.empty());
    cout << answer.size() - 1 << "\n";
    for (int i = 0; i < answer.size() - 1; i++) {
        cout << answer[i].size() << "\n";
        for (int j = 0; j < answer[i].size(); j++) {
            cout << 1 + answer[i][j] << " ";
        }
        cout << "\n";
    }
}