#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <chrono>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <climits>
#include <stack>
#include <valarray>
#include <random>
#include <bitset>
#include <numeric>
#include <iomanip>
#include <cassert>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(x, b, e) for(int x=(b); x<(e); ++x)
#define trav(a, x) for(auto& a : x)
#define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define all(c) c.begin(),c.end()
#define sz(x) ((int)((x).size()))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
#define mp(x,y) make_pair(x,y)
typedef short int sint;
template<typename T> bool ckmin(T& a, const T& b){return b<a?a=b,1:0;}
template<typename T> bool ckmax(T& a, const T& b){return b>a?a=b,1:0;}


template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(char c) {
  return string(1, c);
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif


// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353; // modint1000000007;
// typedef vector<mint> vmi;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // use rng() to get unsigned int
// mt19937_64 for random long longs

vi apply(vi ord, vi moves) {
  set<int> m(all(moves));
  assert(sz(moves) == sz(m));
  vi nord = ord;
  vi vals;
  rep(i, 0, sz(moves)) {
    vals.pb(ord[moves[i]]);
  }
  ford(i, sz(moves), 0) {
    nord[moves[i]] = vals[sz(moves) - i - 1];
  }
  return nord;
}

void verify(vi ord, vector<vi> ans) {
  for (auto a : ans) {
    ord = apply(ord, a);
  }
  rep(i, 0, sz(ord) - 1) {
    assert(ord[i] < ord[i + 1]);
  }
}


vector<vi> solve(vi inp) {
	int n = sz(inp);
  // n = 100;
  vector<pii> a(n);
  rep(i, 0, n) {
    // cin >> a[i].st;
    // if (i < n - 1) a[i].st = i + 2;
    // else a[i].st = 1;
    a[i].st = inp[i];
    a[i].nd = i;
  }
  debug(a);
  sort(all(a));
  debug(a);
  vi p(n);
  rep(i, 0, n) {
    p[a[i].nd] = i;
  }
  debug(p);
  vector<vi> ans;
  while (true) {
    bool sorted = true;
    rep(i, 0, n - 1) {
      if (p[i] > p[i + 1]) {
        sorted = false;
        break;
      }
    }
    if (sorted) break;
    vi vis(n);
    vi przod, tyl;
    rep(i, 0, n) {
      if (p[i] == i || vis[i]) continue;
      vi curCycle;
      vis[i] = 1;
      curCycle.pb(i);
      int x = p[i];
      while (x != i) {
        curCycle.pb(x);
        vis[x] = 1;
        x = p[x];
      }
      if (sz(curCycle) == 2) {
        przod.pb(curCycle[0]);
        tyl.pb(curCycle[1]);
        swap(p[curCycle[0]], p[curCycle[1]]);
      } else {
        // sth longer
        int l = 1, q = sz(curCycle) - 1;
        while (l < q) {
          przod.pb(curCycle[l]);
          tyl.pb(curCycle[q]);
          swap(p[curCycle[l]], p[curCycle[q]]);
          ++l;
          --q;
        }
      }
    }
    assert(sz(przod) == sz(tyl));
    assert(sz(przod) > 0);
    vi ruch;
    rep(i, 0, sz(przod)) ruch.pb(przod[i]);
    ford(i, sz(tyl), 0) ruch.pb(tyl[i]);
    ans.pb(ruch);
    debug(p);
  }
  verify(inp, ans);
  return ans;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n;
  cin >> n;
  vi a(n);
  rep(i, 0, n) {
    cin >> a[i];
  }
  auto ans = solve(a);
  cout << sz(ans) << endl;
  for (auto ve : ans) {
    cout << sz(ve) << endl;
    for (auto v : ve) {
      cout << v + 1 << ' ';
    }
    cout << endl;
  }
}