# include <bits/stdc++.h>
using namespace std;
const int B=3000;
typedef long long ll;
bool ans[4000],vis[4000];
int mch[8000];
ll n;
vector<int> G[4000];
bool dfs(int u)
{
	if(vis[u]) return false;
	vis[u]=1;
	for(int v:G[u])
	{
		int w=mch[v];
		mch[u]=v;mch[v]=u;mch[w]=0;
		if(!w || dfs(w)) return true;
		mch[u]=0;mch[v]=w;mch[w]=v;
	}
	return false;
}
void solve(int K)
{
	for(int i=1;i<=K;i++)
	{
		G[i].push_back(K+n-n/i*i+1);
		for(int j=1;j<i;j++)
			if((n-i+1)%j==0) G[j].push_back(K+i);
		for(int j=1;j<=i;j++)
			if(!mch[j])
			{
				memset(vis,0,sizeof(vis));
				dfs(j);
			}
		ans[i]=1;
		for(int j=1;j<=i;j++) ans[i]&=(mch[j]>0);
	}
}
int main()
{
	cin>>n;
	ans[0]=1;
	if(n<=2*B+1000)
	{
		solve(n/2);
		printf("2\n%lld ",n+1);
		for(int i=0;i<=n;i++)
			if(i<=n/2) printf("%d%c",ans[i]," \n"[i==n]);
			else printf("%d%c",ans[n-i]," \n"[i==n]);
		return 0;
	}
	solve(B);
	puts("61\n2 0 0");
	for(int i=3;i<=60;i++) printf("2 %d %d\n",i-1,i-1);
	vector<int> vec;
	for(int i=0;i<=B;i++) vec.push_back(ans[i]);
	ll len=n+1-2*B;
	for(int i=0;len;i++,len>>=1)
		if(len&1) vec.push_back(i?i+1:i);
	for(int i=B;i>=0;i--) vec.push_back(ans[i]);
	cout<<vec.size();
	for(int i:vec) printf(" %d",i);
	return 0;
}