#include <iostream>
#include <unordered_map>
#include <functional>
#include <algorithm>
#include <vector>
#include <deque>

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	vector<int> V(n);
	for (auto& v : V)
		cin >> v;

	vector<int> S = V;
	sort(S.begin(), S.end());

	unordered_map<int, int> P(n);
	for (int i = 0; i < n; i++)
		P[S[i]] = i;

	vector<deque<int>> R;
	while (true) {
		if (is_sorted(V.begin(), V.end())) {
			cout << R.size() << '\n';
			for (auto& r : R) {
				cout << r.size() << '\n';
				for (auto& q : r)
					cout << q + 1 << ' ';
				cout << '\n';
			}
			break;
		}

		vector<int> C;
		vector<bool> vis(n);
		function<void(int)> DFS = [&](int u) {
			if (vis[u]) return;
			vis[u] = true;
			C.push_back(u);
			DFS(P[V[u]]);
		};

		deque<int> Q;
		for (int i = 0; i < n; i++) {
			C.resize(0);
			if (!vis[i]) {
				DFS(i);
				for (int i = 0; i < C.size() / 2; i++)
					Q.push_front(C[i]), Q.push_back(C[C.size() - i - 1]);
			}
		}

		R.push_back(Q);

		while (Q.size()) {
			swap(V[Q.front()], V[Q.back()]);
			Q.pop_back(), Q.pop_front();
		}
	}
}