#include<bits/stdc++.h>
using namespace std;
long long n;
int k;
int vist[100005],p[100005];
bool dfs(int x){
	if(!x)return 1;
	for(int i=1;i<=k;++i)if(!vist[i]&&(n-i+1)%x==0){
		vist[i]=1;
		if(dfs(p[i])){
			p[i]=x;
			return 1;
		}
	}
	return 0;
}
bool solve(){
	for(int i=1;i<=k;++i)p[i]=0;
	for(int i=1;i<=k;++i){
		for(int j=1;j<=k;++j)vist[j]=0;
		if(!dfs(i))return 0;
	}
	return 1;
}
int vc[100005];
#define B 100
int main(){
	cin>>n;
	for(k=0;k<=B&&k<=n;++k)vc[k]=solve();
	if(n<=2*B+1){
		for(int k=0;k<=B&&k<=n;++k)vc[n-k]=vc[k];
		printf("%d\n",2);
		printf("%d",(int)n+1);
		for(int i=0;i<=n;++i)printf(" %d",vc[i]);
		return 0;
	}
	vector<vector<int>>cc;
	vector<int>v1,v2,v3;
	for(int k=0;k<=B;++k){
		v1.emplace_back(vc[k]);
		v2.emplace_back(vc[B-k]);
	}
	cc.emplace_back(v1);cc.emplace_back(v2);
	n-=2*B+1;
	int ls=4;
	vector<int>vv={0};cc.emplace_back(vv);
	for(int i=1;i<=60;++i){
		vector<int>vv={ls,ls};ls=4+i;
		cc.emplace_back(vv);
	}
	v3.emplace_back(2);
	for(int i=60;i>=0;--i)if((n>>i)&1)
		v3.emplace_back(4+i);
	v3.emplace_back(3);
	cc.emplace_back(v3);
	printf("%d\n",(signed)cc.size()+1);
	for(auto vv:cc){
		printf("%d",(signed)vv.size());
		for(auto cu:vv)printf(" %d",cu);
		printf("\n");
	}
	return 0;
}