1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
//#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
//#define int long long
const int mod=1000000007;
//const int mod=1009;
//const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
int T[3005],P[3005];
vector<vi> W;
vi H;
map<int,int> M;
bool O[3005];
void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>T[i];
        H.pb(T[i]);
    }
    sort(H.begin(),H.end());
    for(int i=0;i<H.size();i++){
        M[H[i]]=i+1;
    }
    for(int i=1;i<=n;i++){
        T[i]=M[T[i]];
        P[T[i]]=i;
        //cout<<T[i]<<" ";
    }
    //cout<<endl;
    int wsk=1;
    while(wsk<=n){
        if(P[wsk]==wsk){
            wsk++;
            continue;
        }
        vi A,B,C;
        int wsk2=wsk;
        while(wsk2<=n){
            int poz=P[wsk2];
            if(O[poz]||O[wsk2]||wsk2==poz){
                wsk2++;
                continue;
            }
            int x=T[wsk2];
            T[wsk2]=wsk2;
            P[wsk2]=wsk2;
            T[poz]=x;
            P[x]=poz;
            O[poz]=1,O[wsk2]=1;
            A.pb(wsk2);
            B.pb(poz);
            wsk2++;
        }
        for(auto a:A)
            C.pb(a);
        reverse(B.begin(),B.end());
        for(auto b:B)
            C.pb(b);
        W.pb(C);
        wsk++;
        for(int i=1;i<=n;i++)
            O[i]=0;
    }
    cout<<W.size()<<"\n";
    for(auto w:W){
        cout<<w.size()<<"\n";
        for(auto v:w)
            cout<<v<<" ";
        cout<<"\n";
    }

}
    
int32_t main(){
    speed
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}