#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ssize(x) int(x.size())
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
// #define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define FORE(i, l, r) for(int i = (l); i <= (r); ++i)
// # define REP(i, n) FOR(i, 0, (n) - 1)
# define REP(i, n) FORE(i, 0, (n) - 1)
#define FORR(x,arr) for(auto &x: arr)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "),...); }(x), cerr << '\n'
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
using namespace std;
using namespace __gnu_pbds;

#ifdef ONLINE_JUDGE
#define debug(...) {}
#endif
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) { return o << '(' << p.first << ", " << p.second << ')'; }
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) { o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}'; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// 1 << 19 if segtree where merges matter.
#define N 1000001

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    sc(n);
    pair<int,int> a[n];
    pair<int,int> b[n];
    vi sth;
    FOR(i,0,n){
        sc(a[i].e1);
        sth.push_back(a[i].e1);
    }
    sort(all(sth));
    vector<deque<int>> vec;
    FOR(i,0,n){
        a[i].e2 = lower_bound(all(sth), a[i].e1) - sth.begin();
    }
    int mxlen = 0;
    FOR(i,0,n){
        int x = i;
        int crlen = 1;
        while(a[x].e2 != i){
            x = a[x].e2;
            ++crlen;
        }
        mxlen = max(mxlen, crlen);
    }
    int pw = 0;
    while((1 << pw) < mxlen){
        ++pw;
    }
    memcpy(b, a, sizeof b);
    for(;;){
        deque<int> cr;
        // shit, 15 mins do końca, clutch z cyklami let's go.
        // 23:47, local tests passed. Clutch let's go? :))
        // Can't believe że zadanie Z CYKLAMI i dopiero pod koniec zacząłem
        // actually go rozważąć cyklowo. So much for cykle being my speciality.
        // (Shadow of Linkus winner of CodeChef round because cykle rozjebał)
        // Jeszcze do dziś nie mam cykli w biblio btw xddddddd.
        bool vis[n];
        memset(vis, 0, n);
        FOR(i,0,n){
            if(vis[i]) continue;
            int x = i;
            vi crcyk = {i};
            vis[i] = 1;
            while(a[x].e2 != i){
                x = a[x].e2;
                crcyk.push_back(x);
                vis[x] = 1;
            }
            for(int x = 0; x + 1 < crcyk.size(); x += 2){
                cr.push_front(crcyk[x]);
                cr.push_back(crcyk[x + 1]);
                /* touched[i] = touched[a[i].e2] = 1; */
                /* swap(cr[i], cr[a[i].e2]); */
                /* debug(i, a[i].e2); */
                swap(a[crcyk[x]], a[crcyk[x + 1]]);
            }
        }
        /* bool touched[n]; */
        /* memset(touched, 0, n); */
        /* FOR(i,0,n){ */
        /*     /1* if(i != a[i].e2){ *1/ */
        /*     // thx asserts and testing. */
        /*     /1* if(i < a[i].e2){ *1/ */
        /*     if(i != a[i].e2 && !touched[i] && !touched[a[i].e2]){ */
        /*         cr.push_front(i); */
        /*         cr.push_back(a[i].e2); */
        /*         touched[i] = touched[a[i].e2] = 1; */
        /*         /1* swap(cr[i], cr[a[i].e2]); *1/ */
        /*         /1* debug(i, a[i].e2); *1/ */
        /*         swap(a[i], a[a[i].e2]); */
        /*     } */
        /* } */
        /* debug(cr); */
        if(cr.empty()) break;
        vec.push_back(std::move(cr));
    }
    cout << vec.size() << '\n';
    FORR(i,vec){
        cout << i.size() << '\n';
        FORR(x,i)
            cout << x + 1 << ' ';
        cout << '\n';
        pi c[n];
        memcpy(c,b,sizeof c);
        FOR(x,0,i.size()){
            c[i[x]] = b[i[i.size() - x - 1]];
        }
        memcpy(b,c,sizeof c);
    }
    /* FORR(i,a) */
    /*     cout << i << ' '; */
    /* cout << '\n'; */
    /* FORR(i,b) */
    /*     cout << i << ' '; */
    /* cout << endl; */
    assert(!memcmp(a, b, sizeof a));
    assert(vec.size() == pw);
}

/*
 * 16
 * 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1
 * 4
 * 16
 * 15 13 11 9 7 5 3 1 2 4 6 8 10 12 14 16 
 * 8
 * 13 9 5 1 3 7 11 15 
 * 4
 * 9 1 5 13 
 * 2
 * 1 9 
 * */