#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<30)-1
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
#define vii vector<int>
#define vll vector<long long>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

int k;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
    cin >> k;
    vll power2;
    ll p = 1LL;
    ll y = 0, z = 0, n = 0, cnt = 0;
    if (k == 0) {
      cout << 1 << endl;
      cout << 0 << endl;
      return 0;
    }
    while (p < 1e9+1LL) {
        erep(i, 2, 30) {
            n = i;
            y = n - cnt;
            z = p;
            if (y >= 2 && 2 * k == z * y * (y - 1)) {
                cout << n << endl;
                rep(j, 0, n) {
                    if (j < y) cout << "1";
                    else cout << "0";
                    cout << (j != n-1 ? " " : "\n"); 
                }
                return 0;
            }
        }
        p *= 2;
        cnt++;
    }
    return 0;
}