#include <bits/stdc++.h>
using namespace std;
ostream& operator<<(ostream& out, const vector<long long>& b) {
  for (auto k : b) out << k << " ";
  return out;
}
istream& operator>>(istream& in, pair<long long, long long>& b) {
  in >> b.first >> b.second;
  return in;
}
ostream& operator<<(ostream& out, const pair<long long, long long>& b) {
  out << "{" << b.first << ", " << b.second << "}";
  return out;
}
template <typename T1, typename T2>
inline bool chkmin(T1& x, const T2& y) {
  if (x > y) {
    x = y;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool chkmax(T1& x, const T2& y) {
  if (x < y) {
    x = y;
    return 1;
  }
  return 0;
}
const long long INF = 1e18;
const long double PI = acos(-1);
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
bool good(const vector<long long>& a) {
  for (long long i = 1; i < a.size(); i++) {
    if (a[i] - a[i - 1] != 1) {
      return 0;
    }
  }
  return 1;
}
void make(vector<long long>& a, vector<long long>& blocks) {
  long long ind = 0;
  long long sz = blocks.size();
  vector<vector<long long>> w(sz);
  for (long long i = 0; i < sz; i++) {
    for (long long j = 0; j < blocks[i]; j++) {
      w[i].push_back(a[ind]);
      ind++;
    }
  }
  a.clear();
  for (long long i = sz - 1; i >= 0; i--) {
    for (auto k : w[i]) {
      a.push_back(k);
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<vector<long long>> ans;
  while (!good(a)) {
    vector<long long> pos(n + 1, -1);
    vector<long long> cur;
    bool ok = 0;
    for (long long i = n - 1; i >= 0; i--) {
      if (pos[a[i] - 1] != -1 && !ok) {
        long long ind = pos[a[i] - 1];
        while (ind > 0 && a[ind - 1] == a[ind] - 1) {
          ind--;
        }
        if (i > 0) {
          cur.push_back(i);
        }
        cur.push_back(ind - i);
        cur.push_back(pos[a[i] - 1] - ind + 1);
        if (pos[a[i] - 1] < n - 1) {
          cur.push_back(n - pos[a[i] - 1] - 1);
        }
        ans.push_back(cur);
        make(a, cur);
        ok = 1;
      }
      pos[a[i]] = i;
    }
  }
  cout << ans.size() << "\n";
  for (auto k : ans) {
    cout << k.size() << " " << k << "\n";
  }
}
