Problem: You are given a deck of n cards numbered from 1 to n (not necessarily in this order in the deck). You have to sort the deck by repeating the following operation. 

  * Choose 2 ≤ k ≤ n and split the deck in k nonempty contiguous parts D_1, D_2,..., D_k (D_1 contains the first |D_1| cards of the deck, D_2 contains the following |D_2| cards and so on). Then reverse the order of the parts, transforming the deck into D_k, D_{k-1}, ..., D_2, D_1 (so, the first |D_k| cards of the new deck are D_k, the following |D_{k-1}| cards are D_{k-1} and so on). The internal order of each packet of cards D_i is unchanged by the operation. 



You have to obtain a sorted deck (i.e., a deck where the first card is 1, the second is 2 and so on) performing at most n operations. It can be proven that it is always possible to sort the deck performing at most n operations.

Examples of operation: The following are three examples of valid operations (on three decks with different sizes). 

  * If the deck is [3 6 2 1 4 5 7] (so 3 is the first card and 7 is the last card), we may apply the operation with k=4 and D_1=[3 6], D_2=[2 1 4], D_3=[5], D_4=[7]. Doing so, the deck becomes [7 5 2 1 4 3 6]. 
  * If the deck is [3 1 2], we may apply the operation with k=3 and D_1=[3], D_2=[1], D_3=[2]. Doing so, the deck becomes [2 1 3]. 
  * If the deck is [5 1 2 4 3 6], we may apply the operation with k=2 and D_1=[5 1], D_2=[2 4 3 6]. Doing so, the deck becomes [2 4 3 6 5 1]. 

Input

The first line of the input contains one integer n (1≤ n≤ 52) — the number of cards in the deck.

The second line contains n integers c_1, c_2, ..., c_n — the cards in the deck. The first card is c_1, the second is c_2 and so on.

It is guaranteed that for all i=1,...,n there is exactly one j∈\{1,...,n\} such that c_j = i.

Output

On the first line, print the number q of operations you perform (it must hold 0≤ q≤ n).

Then, print q lines, each describing one operation.

To describe an operation, print on a single line the number k of parts you are going to split the deck in, followed by the size of the k parts: |D_1|, |D_2|, ... , |D_k|. 

It must hold 2≤ k≤ n, and |D_i|≥ 1 for all i=1,...,k, and |D_1|+|D_2|+⋅⋅⋅ + |D_k| = n.

It can be proven that it is always possible to sort the deck performing at most n operations. If there are several ways to sort the deck you can output any of them.

Examples

Input


4
3 1 2 4


Output


2
3 1 2 1
2 1 3


Input


6
6 5 4 3 2 1


Output


1
6 1 1 1 1 1 1


Input


1
1


Output


0

Note

Explanation of the first testcase: Initially the deck is [3 1 2 4]. 

  * The first operation splits the deck as [(3) (1 2) (4)] and then transforms it into [4 1 2 3]. 
  * The second operation splits the deck as [(4) (1 2 3)] and then transforms it into [1 2 3 4]. 

Explanation of the second testcase: Initially the deck is [6 5 4 3 2 1]. 

  * The first (and only) operation splits the deck as [(6) (5) (4) (3) (2) (1)] and then transforms it into [1 2 3 4 5 6]. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
template <class T>
void chmax(T &a, const T &b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, const T &b) {
  if (b < a) a = b;
}
vector<int> csort(vector<int> &c, vector<int> &tmp) {
  vector<int> ret;
  int ptr = c.size();
  for (int i = (tmp.size()) - 1, i_begin_ = (0); i >= i_begin_; i--) {
    ptr -= tmp[i];
    for (int j = (0), j_end_ = (tmp[i]); j < j_end_; j++)
      ret.push_back(c[ptr + j]);
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<int> c(n);
  for (int i = (0), i_end_ = (n); i < i_end_; i++) cin >> c[i];
  for (int i = (0), i_end_ = (n); i < i_end_; i++) c[i]--;
  int opes = 0;
  vector<vector<int>> ans;
  while (true) {
    bool comp = true;
    for (int i = (0), i_end_ = (n); i < i_end_; i++)
      if (c[i] != i) {
        comp = false;
        break;
      }
    if (comp) break;
    vector<int> tmp;
    for (int i = (0), i_end_ = (opes); i < i_end_; i++) tmp.push_back(1);
    if ((n - opes) % 2 == 0) {
      for (int i = (0), i_end_ = (n); i < i_end_; i++)
        if (c[i] == opes) {
          tmp.push_back(i + 1 - opes);
          if (n - 1 - i > 0) tmp.push_back(n - 1 - i);
          break;
        }
    } else {
      for (int i = (0), i_end_ = (n); i < i_end_; i++)
        if (c[i] == opes) {
          tmp.push_back(n - opes - i);
          if (i > 0) tmp.push_back(i);
          break;
        }
      reverse((tmp).begin(), (tmp).end());
    }
    if (tmp.size() > 1) {
      ans.push_back(tmp);
      c = csort(c, tmp);
    }
    opes++;
  }
  cout << ans.size() << endl;
  for (int i = (0), i_end_ = (ans.size()); i < i_end_; i++) {
    cout << ans[i].size() << " ";
    for (int j = (0), j_end_ = (ans[i].size()); j < j_end_; j++)
      cout << ans[i][j] << (j != ans[i].size() - 1 ? " " : "");
    cout << "\n";
  }
}