//Solution by Mikołaj Kołek

#include "bits/stdc++.h"
#define intin *istream_iterator<int>(cin)

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n = intin;
	vector<int> h(n);
	copy_n(istream_iterator<int>(cin), n, h.begin());
	
	vector<pair<int, int>> sortedH;
	for(int i = 0; i < n; i++)
		sortedH.push_back({ h[i], i });
	sort(sortedH.begin(), sortedH.end());
	
	vector<int> G(n), revG(n);
	for(int i = 0; i < n; i++) {
		G[sortedH[i].second] = i;
		revG[i] = sortedH[i].second;
	}
	
	array<deque<int>, 2> res;
	vector<bool> vis(n);
	function<bool(int, bool)> DFS = [&] (int v, int first) {
		if(vis[v] or G[v] == v)
			return false;
		vis[v] = true;
		
		bool val = DFS(G[v], first);
		if(first != v) {
			res[val].push_back((first != revG[v] and val) ? revG[v] : v);
			res[val].push_front(G[v]);
		}
		return !val;
	};
	
	for(int i = 0; i < n; i++)
		DFS(i, i);
	
	cout << (res[1].empty() ? 1 : 2) << "\n";
	for(auto &row : res) {
		if(!row.empty()) {
			cout << row.size() << "\n";
			
			for(const auto &el : row)
				cout << el + 1 << " ";
			
			cout << "\n";
		}
	}
	
	return 0;
}