#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<numeric>
#include<vector>
#include<string>
using namespace std;
typedef long long lng;
#define UP(i,a,b) for(int i=(a); i<=(b); ++i)
#define DOWN(i,b,a) for(int i=(b); i>=(a); --i)
#define REP(i,n) UP(i,0,(n)-1)
#define ALL(a) (a).begin(), (a).end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) //NOTE: <a> must be sorted in advance

lng power(lng b, int n) {lng sol=1; while(n>0) {if(n&1) {sol=sol*b;} n>>=1; b*= b;} return sol;} //calculate b^n in O(log(n)) time

const int MOD = 1000000007; //10^9+7
const double PI = 3.1415926535897932384626;

/*********** variables ************/
int K;
/**********************************/


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> K;

    if(K == 0) {
        cout << 1 << endl;
        cout << 0 << endl;
        return 0;
    }
    UP(k, 2, 30) {
        lng sol = k * (k - 1) / 2;
        int m = 0;
        while(m + k <= 30) {
            if(sol == K) {
                cout << k + m << endl;
                cout << 1;
                REP(i, k-1) cout << " 1";
                REP(i, m) cout << " 0";
                cout << endl;
                return 0;
            }
            ++m;
            sol *= 2;
        }
    }
}