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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;

typedef pair<int,int> ii;

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

const int MOD = 998244353;

ll read(){
    ll i;
    cin>>i;
    return i;
}

vi readvi(int n,int off=0,int shift=0){
    vi v(n+shift);
    rep(i,shift)v[i]=0;
    rep(i,n)v[i+shift]=read()+off;
    return v;
}

void YesNo(bool condition, bool do_exit=true) {
    if (condition)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    if (do_exit)
        exit(0);
}

bool is_id (vi & a) {
    rep(i,a.size())
        if (a[i] != i)
            return false;
    return true;
}

int num_non_loops (vi & a) {
    int res = 0;
    rep(i,a.size())
        if (a[i] != i)
            ++res;
    return res;
}

vi inverse (vi & a) {
    int n = a.size();
    vi res(n);
    rep(i,n)
        res[a[i]] = i;
    return res;
}

int main(void ) {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;
    vi a = readvi(n);

    vector<ii> b;
    rep(i,n)
        b.push_back({a[i],i});

    sort(b.begin(),b.end());

    rep(i,n)
        a[b[i].second] = i;

    //teraz a[0..n-1] jest permutacją liczb 0..n-1

    vvi res;

    while (not is_id(a)) {
        vi inv_a = inverse(a);
        vector<bool> visited(n,false);
        vector<ii> pairs;
        rep(i,n)
            if (not visited[i] and a[i] != i) {
                int len = 1;
                int j = i;
                while (a[j] != i) {
                    j = a[j];
                    visited[j] = true;
                    ++len;
                }

                if (len == 2)
                    pairs.push_back({i, a[i]});
                else { // (3+)-cycle
                    int j1 = i, j2 = i;
                    rep(_,(len-1)/2) {
                        j1 = a[j1];
                        j2 = inv_a[j2];
                        pairs.push_back({j1, j2});
                    }
                }
            }
        vi s(2*pairs.size());
        int i=0;
        for (auto [x,y] : pairs) {
            s[i] = x;
            s[2*pairs.size()-1-i] = y;
            ++i;
        }
        res.push_back(vi());
        rep(j,s.size())
            res.back().push_back(inv_a[s[j]]+1);

        vi rev = s;
        reverse(rev.begin(), rev.end());

        rep(j,s.size())
            a[inv_a[s[j]]] = rev[j];

    }

    cout << res.size() << endl;
    for (auto & seq : res) {
        cout << seq.size() << endl;
        for (auto x : seq)
            cout << x << " ";
        cout << endl;
    }

    return 0;
}