#include <bits/stdc++.h>
using namespace std;
typedef  long long int ll;
#define rep(i, n) for (int i = 0; i < (n); i++)

ll f(int zero, int one) {
    if (one <=1)
        return 0;
    ll p = 1;
    for (int i = 1; i <=zero; i++)
        p = p << 1;
    return p * (one * (one -1))/2LL;
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int k;
    cin >> k;


    for (int i = 1; i <= 30; i++) {
        for (int j = 0; j <= i; j++) {
            int zeros = j;
            int ones = i - j;
            //printf("zeros=%d ones=%d %d\n", zeros, ones, f(zeros, ones));
            if (f(zeros, ones) == k) {
                vector<int> v;
                for (int m = 0; m < zeros; m++)
                    v.push_back(0);
                for (int m = 0; m < ones; m++)
                    v.push_back(1);

                cout << v.size() << endl;
                for (int m = 0; m < v.size(); m++) {
                    cout << v[m] << " ";
                }
                cout << endl;
                return 0;
            }
        }
    }
    return 0;
}