#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

int main(){
  lint k;
  cin>>k;
  rep(i,31){
    rep(j,31-i){
      if(i+j==0)continue;
      lint u=i*(i-1)/2;
      u<<=j;
      if(k==u){
	cout<<i+j<<endl;
	rep(k,i+j){
	  cout<<(k<i?1:0)<<(k==i+j-1?"\n":" ");
	}
	return 0;
      }
    }
  }
}