#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

ll C[31][31];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int K; cin >> K;
    for(int i=0;i<=30;i++){
        for(int j=0;j<=i;j++){
            if(j == 0 or i == j){
                C[i][j] = 1;
            }
            else{
                C[i][j] = C[i-1][j] + C[i-1][j-1];
            }
        }
    }
    for(int i=0;i<=30;i++){
        for(int j=0;j+i<=30;j++){
            if(i+j == 0)continue;
            ll u = C[j][2]*(1LL<<i);
            if(u == K){
                cout << i+j << endl;
                for(int k=0;k<i;k++){
                    cout << 0 << " ";
                }
                for(int k=0;k<j;k++){
                    cout << 1 << " ";
                }
                cout << endl;
                return 0;
            }
        }
    }
}