#include<bits/stdc++.h>
#define fi first
#define se second
#define ull unsigned long long
#define make make_pair
#define N 1000006
#define push push_back
#define pop pop_back
#define top(x) t[x][t[x].size()-1]
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int n,p[N],ans,s[N],w[N],cnt;
vector<int> t[N],e[N];
bool dfs(int x,int mx,int pos)
{
//	cout<<x<<" "<<mx<<" "<<pos<<"|\n";
	if(x==ans+1)return 1;
	while(t[x].size()&&top(x)<mx)t[x].pop();
	while(t[x].size())
	{
		if(w[top(x)]<pos)return 0;
		int y=top(x);t[x].pop();
		e[cnt+1][x]=w[y];
		if(dfs(x+1,y,w[y]))return 1;
	}
	return 0;
}
signed main()
{
	n=read();
	for(int i=1;i<=n;i++)
	{
		p[i]=read();
		w[p[i]]=i;
	}
	for(int i=1;i<=n;i++)
	{
		int x=upper_bound(s,s+1+ans,p[i])-s;
		if(x==ans+1)ans++;
		t[x].push(p[i]);
		s[x]=p[i];
	}
	for(int i=1;i<=ans+1;i++)e[cnt+1].push(0);
	while(dfs(1,-1,-1))
	{
		++cnt;
		for(int i=1;i<=ans+1;i++)e[cnt+1].push(0);
	}
	cout<<cnt<<" "<<ans<<"\n";
	for(int i=1;i<=cnt;i++)
	{
		for(int j=1;j<=ans;j++)
		cout<<e[i][j]<<" ";
		cout<<"\n";
	}
	return 0;
}