#include <bits/stdc++.h>

using namespace std;

bool sorted(vector<int> &v){
    for(int i = 0; i < v.size() - 1; i++){
        if(v[i] > v[i + 1]){
            return false;
        }
    }
    return true;
}

int main(){
    int n;
    cin >> n;
    //cout << n << endl;
    vector<int> h(n), pos(n, 0);
    for(int i = 0;  i < n; i++){
        cin >> h[i];
        //cout << h[i] << ' ';
    }
    //cout << endl;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(h[j] < h[i]){
                pos[i]++;
            }
        }
    }
    vector<vector<int>> answer;
    while(!sorted(h)){
        vector<vector<int>> cycles;
        vector<bool> processed(n, false);
        for(int i = 0; i < n; i++){
            if(processed[i]) continue;
            if(pos[i] == i) continue;
            int akt = pos[i];
            cycles.push_back({i});
            while(akt != i){
                cycles.back().push_back(akt);
                processed[akt] = true;
                akt = pos[akt];
            }
        }
        deque<int> d;
        for(auto cycle : cycles){
            for(int i = 0; i < cycle.size() / 2; i++){
                d.push_front(cycle[i]);
                d.push_back(cycle[cycle.size() - 1 - i]);
                swap(h[cycle[i]], h[cycle[cycle.size() - 1 - i]]);
                swap(pos[cycle[i]], pos[cycle[cycle.size() - 1 - i]]);
            }
        }
        answer.push_back({d.begin(), d.end()});
    }
    cout << answer.size() << '\n';
    for(auto row : answer){
        cout << row.size() << '\n';
        for(auto el : row){
            cout << el + 1 << ' ';
        }
        cout << '\n';
    }
    return 0;
}