#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define int long long 
#define endl "\n"
const int N = 3e5+10;
int n,m,k;
typedef pair<int,int> PII;
int p[N];
int c[N];
void solve()
{
    cin>>n;
    string s;
    if(n==1)
    {
        cout<<2<<endl;
        cout<<1<<endl;
        cout<<1<<' '<<1000<<endl;
        return;
    }
    while(n)
    {
        s+=n%2+'0';
        n/=2;
    }
    reverse(s.begin(),s.end());
    
    int last= 1;
    int len = s.size();
    int now = 0;
    
    int idx= (s.size()-1)*3+1;
    int tem= idx;
    p[idx]=idx-3;
    p[idx-1]=idx-2;
    p[idx-2]=idx-3;
    c[idx]=1;
    c[idx-1]=1;
    c[idx-2]=1;
    if(s[1]=='0')c[idx-3]=1e9;
    else c[idx-3]=2;
    last++;
    idx-=3;
    for(int i = 1;i < len-1;i ++)
    {
        p[idx-1]=idx-2;
        p[idx-2]=idx-3;
        p[idx]=idx-3;
        c[idx-1]=1;
        c[idx-2]=1;
        if(s[i+1]=='0')c[idx-3]=1e9;
        else c[idx-3]=last+1;
        last++;
        idx-=3;
    }
    // c[1]=c[idx];
    cout<<tem<<endl;
    for(int i= 2;i <= tem;i ++)cout<<p[i]<<' ';
    cout<<endl;
    for(int i = 1;i <= tem;i ++)cout<<c[i]<<' ';
    cout<<endl;
    
}
signed  main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
   int t=1;
//   cin>>t;
   while(t--)
   {
       solve();
   }
    return 0;
}