#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) x&(-x)
int n;
int tree[2000005],p[2000005],ans,cnt = 1;
vector<int>res[2000005],pp[2000005];
void upd(int pos,int add){
	for(int i = pos;i<=n;i+=lowbit(i)){
		if(i == pos)tree[i] = add;tree[i] = max(tree[i],add);
	}
}int query(int x){
	int res = 0;
	for(int i = x;i;i-=lowbit(i))res = max(res,tree[i]);
	return res;
}void dfs(int k,int d,int id){
	if(d == ans){
		cnt++;return;
	}for(int i = pp[d+1].size()-1;i>=0;i--){
		if(p[k]>p[pp[d+1][i]]){
			pp[d+1].pop_back();continue;
		}if(!pp[d+1].size() or k>pp[d+1][i]){
			res[cnt].pop_back();return;
		}int e = pp[d+1][i];
		res[cnt].push_back(pp[d+1][i]);pp[d+1].pop_back();
		dfs(e,d+1,cnt);if(cnt!=id)return;
	}
}
signed main(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;for(int i = 1;i<=n;i++)cin>>p[i];
	for(int i = 1;i<=n;i++){
		int d = query(p[i])+1;pp[d].push_back(i);upd(p[i],d);ans = max(ans,d);
	}for(int i = pp[1].size()-1;i>=0;i--){
		int aa = pp[1][i];
		res[cnt].push_back(aa);pp[1].pop_back();
		dfs(aa,1,cnt);
	}cnt--;
	cout<<cnt<< ' '<<ans<< endl;
	for(int i = 1;i<=cnt;i++){
		for(int j =0;j<res[i].size();j++)cout<<res[i][j]<<' ';cout <<'\n';
	}
	return 0;
}