#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
inline int read() {
  int x = 0, w = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') w = -1;
    c = getchar();
  }
  while (c <= '9' && c >= '0') {
    x = (x << 1) + (x << 3) + c - '0';
    c = getchar();
  }
  return w == 1 ? x : -x;
}
int a[1000005], b[1000005], x2, x3, x1;
vector<int> ans[1000005];
int main() {
  int n = read(), tmp = 0;
  for (int i = 1; i <= n; i++) a[i] = read();
  while (1) {
    tmp++;
    x1 = 0, x2 = 0, x3 = 0;
    int q = 0;
    int cnt = 1, p1 = 0, p = 0, f = 0;
    for (int i = 2; i <= n; i++)
      if (a[i - 1 + x2] != a[i] - 1) f = 1;
    if (!f) break;
    for (int i = 1; i <= n; i++)
      if (a[i] != i) {
        p1 = i;
        break;
      }
    if (p1 != 1) ans[tmp].push_back(p1 - 1);
    q = 0;
    x1 = 0;
    x2 = 0;
    x3 = 0;
    for (int i = p1 + 1; i <= n; i++) {
      if (a[i - 1 + x1] == a[i + x2] - 1)
        cnt++;
      else {
        p = a[p1 + x3];
        p1 = i;
        break;
      }
    }
    x1 = 0;
    x2 = 0;
    x3 = 0;
    ans[tmp + x2].push_back(cnt);
    cnt = 1;
    x1 = 0;
    x2 = 0;
    x3 = 0;
    for (int i = p1; i <= n; i++) {
      if (a[i] == p - 1) {
        ans[tmp + x1].push_back(cnt);
        p1 = i;
        break;
      }
      cnt++;
    }
    x1 = 0;
    x2 = 0;
    x3 = 0;
    if (p1 != n) ans[tmp + x3].push_back(n - p1 + x2);
    int P = n, now = 1;
    for (int i = (int)ans[tmp].size() - 1; i >= 0; i--) {
      for (int j = P - ans[tmp][i + x1] + 1; j <= P; j++) b[now++] = a[j + x3];
      P = P - ans[tmp + x2][i + x3];
    }
    for (int i = 1; i <= n; i++) a[i] = b[i + x2];
    x1 ^= x2;
    x2 ^= x3;
  }
  printf("%d\n", tmp - 1);
  for (int i = 1; i <= tmp - 1; i++) {
    printf("%d ", ans[i].size());
    for (int j = 0; j <= (int)ans[i + x3].size() - 1; j++)
      printf("%d ", ans[i][j + x3]);
    puts("");
  }
  return 0;
}
