#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define sp << " " <<
using namespace std;
const int N = 3e5+10,MOD = 1e9+7,inf = 2e12;
void solve() {
int n;
cin >> n;
vi a(n+1);
vector<vi> ans;
for (int i=1;i<=n;i++) cin >> a[i];
assert(n <= 15);
int l = 0;
vi dp(n+1,1);
for (int i = 1;i<=n;i++) {
for (int j = 1;j<i;j++) {
if (a[j] < a[i]) {
dp[i] = max(dp[i],dp[j]+1);
}
}
}
l = *max_element(dp.begin()+1,dp.end());
vi bucks[n+1];
for (int i=1;i<=n;i++) bucks[dp[i]].push_back(i);
while (1) {
vi cur;
int lst = inf;
int fl = 1;
for (int i = l;i>=1;i--) {
if (bucks[i].empty() || bucks[i].back() >= lst) {
fl = 0;
break;
}
cur.push_back(bucks[i].back());
lst = bucks[i].back();
bucks[i].pop_back();
}
if (!fl) break;
reverse(all(cur));
ans.push_back(cur);
}
cout << ans.size() sp l << endl;
for (auto it : ans) {
for (auto itt : it) cout << itt << ' ';
cout << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
