#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxn = 100005;
vector<int>parent(mxn);
vector<int>cost(mxn);
vector<int>nodes;
int cur = 0;
void dfs(int u, int p, int v, int c){
    parent[u] = p;
    cost[u] = c;
    nodes.push_back(u);
    v--;
    if(v==0){
        return;
    }
    if(v%2==0 && v>=4){
        cur++;
        dfs(cur,u,2,1);
        cur++;
        dfs(cur,u,v/2,c-1);
        return;
    }
    cur++;
    dfs(cur,u,v,c);
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int k;
    cin >> k;
    if(k==1){
        cout << "2\n";
        cout << "1\n";
        cout << "2 1\n";
        return 0;
    }
    cur = 1;
    dfs(1,0,k,(int)1e9);
    int n = nodes.size();
    cout << n << '\n';
    for(int i = 2; i<=n; i++){
        cout << parent[i];
        if(i<n)cout << ' ';
    }
    cout << '\n';
    for(int i = 1; i<=n; i++){
        cout << cost[i];
        if(i<n)cout << ' ';
    }
    cout << '\n';
    return 0;
}