#include <bits/stdc++.h>
using namespace std;
long long n;
long long c;
long long cn;
long long k;
int ar[101][101];
int main() {
  cin >> k;
  n = 3;
  c = 1;
  cn = c * 4;
  n = 3;
  while (cn <= k) {
    c = cn;
    cn *= n + 2;
    cn /= n - 1;
    n++;
  }
  cerr << "finding max... " << n << endl;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (i != j) ar[i][j] = 1;
  cerr << c << " " << k << endl;
  while (c < k) {
    int iter = 1 + 8 * (k - c);
    iter = sqrt(iter);
    iter++;
    iter /= 2;
    if (iter > 1) n++;
    if (iter > 1)
      for (int i = 1; i <= iter; i++) ar[i][n] = ar[n][i] = 1;
    c += iter * (iter - 1) / 2;
  }
  while (c < k) {
    n++;
    ar[1][n] = ar[n][1] = 1;
    ar[n][2] = ar[2][n] = 1;
    c++;
  }
  cerr << "------------->" << endl;
  cout << n << endl;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) cout << ar[i][j];
    cout << endl;
  }
}
