#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  vector<string> res;
  if(N==1){
  	cout<<"1"<<endl;
  	cout<<"1"<<endl;
  	return 0;
  }
  if(N==2){
  	cout<<"2"<<endl;
  	cout<<"0"<<endl;
  	cout<<"11"<<endl;
  	return 0;
  }
  repl(len,2,N+1){
  	string tmp;
  	tmp+="1";
  	rep(i,len-2)tmp+="0";
  	tmp+="1";
  	res.push_back(tmp);
  }
  cout<<res.size()<<endl;
  rep(i,res.size())cout<<res[i]<<endl;

  return 0;
}

