#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV int(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
//const double PI = M_PI;  
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

/*Coding Space*/
void output(int i, int j){
  bool flag = 0;
  cout << i + j << endl;
  rep(ii,i){
    cout << (!flag?"":" ") << 1;
    flag = 1;
  }
  rep(jj,j){
    cout << (!flag?"":" ") << 0;
    flag = 1;
  }
  cout << endl;
}

int main(){
  ll k; cin >> k;
  if(k == 0) {cout << 1 << endl <<  0 << endl; return 0;}
  rep(i,31)for(int j = 0; j + i <= 30; j++){
    if(i == 1) continue;
    ll t = pow(2,j,LLINF);
    if(i*(i-1)/2*t == k){
      output(i,j);
      return 0;
    }
  }
  cerr << "ERROR" << endl;
}