#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int k,cnt,fa[N],val[N],sum[N];
int dfs(int k,int p){
	if(k==0){
		++cnt;
		val[cnt]=sum[cnt]=1;
		sum[p]++;
		fa[cnt]=p;
		return cnt;
	}
	assert(k>=0);
	if(k&1){
		++cnt;int now=cnt;
		int s=dfs(k-1,cnt);
		fa[now]=p;
		val[now]=sum[s];
		sum[p]+=val[now];
		return now;
	}else{
		++cnt;int now=cnt;
		int s=dfs(k/2-1,cnt);
		fa[now]=p;
		val[now]=sum[now]=sum[s]+1;
		sum[p]+=val[now];
		fa[++cnt]=now;val[cnt]=1;
		int tmp=cnt;
		fa[++cnt]=tmp;val[cnt]=1;
		return now;
	}
}
int main(){
	cin>>k;
	if(k==1){
		cout<<2<<endl;
		cout<<1<<endl;
		cout<<1<<" "<<2<<endl;return 0;
	}
	k--;
	dfs(k,0);
	cout<<cnt<<endl;
	for(int i=2;i<=cnt;i++)cout<<fa[i]<<" ";
	cout<<endl;
	for(int i=1;i<=cnt;i++)cout<<val[i]<<" ";
	cout<<endl;
	return 0;
}