#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <string>
#include <cmath>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rREP(i, k, n) for (int i = (int)(n)-1; i >= k; i--)

#define debug(x) cerr<<#x<<": "<<x<<'\n'

#define fi first
#define se second

#define vi vector<int>
#define pb push_back
#define mp make_pair

#define pcnt __builtin_popcount

typedef long long ll;

const int inf = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int k;
    cin >> k;
    int a[100000] = {};
    int s = 0;
    if(k==0) {
      cout << 1 << endl;
      cout << 0 << endl;
    }
    REP(i,1,100000){
      s += i;
      a[i+1]=s;
      if(s>1000000000) break;
    }
    int cnt1 = 0;
    int cnt0 = 0;
    bool flag = false;
    while(true){
      rep(i,100000){
        if(a[i]==k){
          cnt1 = i;
          flag = true;
        }
      }
      if(flag) break;
      k/=2;
      // cout <<"k : " <<k << endl;
      cnt0 ++;
    }
    int cc = cnt0 + cnt1;
    cout << cc << endl;
    rep(i,cnt1) cout << 1 << " ";
    rep(i,cnt0) cout << 0 << " ";
    cout << endl;
    return 0;
}