/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) (int)(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x,i) (1&((x)>>(i)))
#define MASK(x) (1LL<<(x))
#define task "FOT"  
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int a[maxn];
int ok[maxn];
vector<int>vt;
vector<int>q[maxn];
int st[maxn];
vector<pair<int,int>>ans[maxn];
int k=0;
int pos[maxn];
void dequy(vector<int>q,int ti){
    if(len(q)<=1){
        return;
    }
    if(len(q)==2){
        k=max(k,1);
        ans[ti].pb({q[0],q[1]});
        return;
    }
    k=max(k,ti);
    int sz=len(q);
    vector<int>d1=q;
    for(int i=0;i<q.size();i++){
        pos[q[i]]=i;
    }
    int so=sz-1;
    ans[ti+1].pb({q[0],q[1]});
    for(int i=1;i<so;i++){
        ans[ti].pb({q[i],q[so]});
        swap(q[i],q[so]);
        so--;
    }
    for(int i=2;i<q.size();i++){
        if(d1[pos[q[i]]+1]>d1[i]){
            ans[ti+1].pb({d1[pos[q[i]]+1],d1[i]});   
        }
    }
    k=2;
    
}
signed main()
{
	cin.tie(0),cout.tie(0)->sync_with_stdio(0);
    // freopen(task".inp" , "r" , stdin);
    // freopen(task".out" , "w" , stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
    	cin>>a[i];
    	vt.pb(a[i]);
    }
    sort(vt.begin(),vt.end());
    vt.resize(distance(vt.begin(),unique(vt.begin(),vt.end())));
    for(int i=1;i<=n;i++){
    	a[i]=lower_bound(vt.begin(),vt.end(),a[i])-vt.begin()+1;
        cout<<a[i]<<" ";
    }
    cout<<'\n';
    int cycle=0;
    int d=0;
    for(int i=1;i<=n;i++){
    	if(ok[a[i]]==0){
    		int x=i;
    		cycle++;
    		while(ok[x]==0){
    			ok[x]=1;
    			q[cycle].pb(x);
    			x=a[x];
    		}
            for(auto v:q[cycle]){
                cout<<v<<' ';
            }
            cout<<"\n";
            dequy(q[cycle],1);
    	}
    }
    cout<<k<<"\n";
    for(int i=1;i<=k;i++){
    	deque<int>de;
    	for(auto v:ans[i]){
    		de.push_front(v.fi);
    		de.push_back(v.se);
    		
    	}
    	cout<<de.size()<<"\n";
    	for(auto v:de){
    		cout<<v<<" ";
    	}
    	cout<<'\n';
    }
    return 0;
}