#include <iostream>
#include <utility>
#include <algorithm>
#include <deque>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<pair<int, int>> tab(n);
    for(int i = 0; i < n; i++)
    {
        cin >> tab[i].first;
        tab[i].second = i;
    }
    vector<vector<int>> wynik;
    while(!is_sorted(tab.begin(), tab.end())){
        vector<pair<int, int>> c = tab;
        vector<bool> taken(n);
        deque<int> l, r;
        sort(c.begin(), c.end());
        for(int i = 0; i < n; i++)
        {
            if (!taken[i] && !taken[c[i].second] && c[i].second != i)
            {
                l.push_back(c[i].second);
                r.push_front(i);
                taken[i] = true;
                taken[c[i].second] = true;
                swap(tab[i].first, tab[c[i].second].first);
            }
        }
        wynik.push_back(vector<int>(0));
        while(!l.empty())
        {
            wynik.back().push_back(l.front());
            l.pop_front();
        }
        while(!r.empty())
        {
            wynik.back().push_back(r.front());
            r.pop_front();
        }
    }

    cout << wynik.size() << endl;
    for(auto v : wynik)
    {
        cout << v.size() << endl;
        for(auto i : v)
        {
            cout << i + 1 << " ";
        }
        cout << endl;
    }
    return 0;
}