#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;

int main() {
    file();
    // ios::sync_with_stdio(false),cin.tie(0);
    int K;
    cin>>K;
    if (K==1) {
        puts("2");
        puts("1");
        puts("1 2");
        return 0;
    }
    int k=30;
    while (!(K>>k&1)) --k;
    --k;
    static int fa[23333],w[23333];
    int n=1; w[1]=1;
    int tot=1;
    while (k>=0) {
        fa[n]=n+3,w[n+3]=1e9;
        fa[n+1]=n+2,fa[n+2]=n+3;
        w[n+1]=w[n+2]=1;
        n+=3;
        tot+=1;

        if (K>>k&1) {
            fa[n]=n+1,w[n+1]=tot;
            n++;
        }
        --k;
    }
    cout<<n<<'\n';
    rep(i,2,n) cout<<n+1-fa[n+1-i]<<" \n"[i==n];
    rep(i,1,n) cout<<w[n+1-i]<<" \n"[i==n];
    return 0;
}