#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N = 2e5 + 1;

int idx,fa[N],l[N],r[N],val[N];

int dfs(int u,int sum) { // 为节点 u 建造一颗能贡献 sum 种方案的子树，并返回子树的根节点编号
    fa[++idx] = u, sum = sum - 1;
    int temp = idx;
    if (sum == 0) {
        val[idx] = 1;
        return idx;
    }
    int x = 1;
    if(sum % 2 == 0) x = 2;
    l[temp] = dfs(temp,x);
    r[temp] = dfs(temp,sum/x);
    val[temp] = val[l[temp]] + val[r[temp]];
    return temp;
}

signed main(){
    int k;
    cin >> k;
    if(k == 1){
        cout << 2 << '\n' << 1 << '\n' << 100 << ' ' << 1 <<'\n';
        return 0;
    }
    dfs(0,k);
    cout << idx << '\n';
    for(int i=2;i<=idx;i++){
        cout << fa[i] << ' ';
    }
    cout << '\n';
    for(int i=1;i<=idx;i++) cout << val[i] << ' ';
    cout << '\n';
}