#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 6005
#define inf 0x3f3f3f3f

int n,res[maxn];
vi e[maxn];
int bel[maxn];
bool vis[maxn];
bool dfs(int u){
	if(vis[u])return 0; vis[u]=1;
	for(int v:e[u]){
		int w=bel[v];
		bel[u]=v,bel[v]=u;
		if(!w)return 1;
		bel[w]=0;
		if(dfs(w))return 1;
		bel[u]=0,bel[v]=w,bel[w]=v;
	}return 0;
}
void solve(int m)
{
	res[0]=1;
	For(i,1,m){
		e[i].pb(m+(n-n/i*i)+1);
		For(j,1,i-1) if((n-i+1)%j==0) e[j].pb(m+i);
		memset(vis,0,sizeof vis);
		For(j,1,i)
			if(!bel[j] && dfs(j)) memset(vis,0,sizeof vis);
		bool ok=1;
		For(j,1,i)if(!bel[j]){ok=0;break;}
		res[i]=ok;
	}
}
void brute(){
	solve(n/2);
	cout<<2<<"\n"<<n+1<<' ';
	For(i,0,n)if(i<=n/2)cout<<res[i]<<' ';else cout<<res[n-i]<<" "; exit(0);
}
vi o;
void qwq(int n){
	Rep(i,60,0)
		if(n>>i&1){
			if(!i)o.pb(0);
			else o.pb(i);
		}
}
signed main()
{
	n=read();
	if(n<=6005)brute();
	solve(3000);
	cout<<61<<"\n";
	cout<<"2 0 0\n";
	For(i,3,60)cout<<2<<" "<<i-1<<" "<<i-1<<"\n";
	For(i,0,3000)o.pb(res[i]);
	qwq(n-2*3000-1);
	Rep(i,3000,0)o.pb(res[i]);
	cout<<o.size()<<" ";
	for(int x:o)cout<<x<<" ";
	return 0;
}