#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(ll i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int mod = 1e9+7;

int K;
int main(){
    cin>>K;
    if(K==0){
        cout<<1<<endl;
        cout<<0<<endl;
        return 0;
    }
    REP(i,2,31){
        REP(j,0,i){
            if(pow(2,j)*(i-j)*(i-j-1)==K*2){
                cout<<i<<endl;
                REP(k,0,j){
                    cout<<0<<" ";
                }REP(k,0,i-j-1){
                    cout<<1<<" ";
                }
                cout<<1<<endl;
                return 0;
            }
        }
    }

    return 0;
}