#include<bits/stdc++.h>
using namespace std;
#define N 20020
typedef long long ll;
int n,a[N];
vector<vector<int> > ans;
void work(vector<int> V){
	ans.push_back(V);
	int l=1,r=0;
	for(auto x:V){
		r=l+x;
		reverse(a+l,a+r);
		l=r;
	}
	assert(r==n+1);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;++i){
		cin>>a[i];
	}
	for(int d=14;d>=0;--d){
		while(true){
			vector<int> A;
			vector<pair<int,int> > tmp;
			int len=1;
			bool need=0;
			for(int i=1;i<=n;++i){
				if(i<n&&(a[i]>>d)==(a[i+1]>>d)){
					++len;
					continue;
				}
				tmp.emplace_back(a[i]>>d&1,len);
				if(i==n||(a[i]>>d+1)!=(a[i+1]>>d+1)){
					if(tmp[0].first==1){
						tmp.insert(tmp.begin(),make_pair(0,0));
					}
					if(tmp.size()>2)need=1;
					for(int i=0;i<(int)tmp.size();i+=3){
						if(tmp[i].second>0){
							A.push_back(tmp[i].second);
						}
						if(i+1<(int)tmp.size()){
							A.push_back(tmp[i+1].second+(i+2>=(int)tmp.size()?0:tmp[i+2].second));
						}
					}
					tmp.clear();
				}
				len=1;
			}
			if(!need)break;
			work(A);
			break;
		}
	}
	if(ans.size()&1){
		ans.push_back(vector<int>(n,1));
	}
	int cnt=0;
	for(int i=0;i<(int)ans.size();++i){
		if(ans[i].size()==1)continue;
		++cnt;
	}
	cout<<cnt<<'\n';
	int op=0;
	for(int i=0;i<(int)ans.size();++i){
		if(ans[i].size()==1)continue;
		auto A=ans[i];
		if(op)reverse(A.begin(),A.end());
		op^=1;
		cout<<A.size()<<' ';
		for(auto x:A)cout<<x<<' ';
		cout<<'\n';
	}
	return 0;
}