#include <bits/stdc++.h>
using namespace std;
int comb3[101];
int comb2[101];
int ans[101][101];
void fill_comb() {
  int i;
  comb2[2] = 1;
  for (i = 3; i < 101; i++) {
    comb3[i] = (i * (i - 1) * (i - 2)) / 6;
    comb2[i] = (i * (i - 1)) / 2;
  }
}
void give_result(int i) {
  int l, m;
  for (l = 1; l <= i; l++) {
    for (m = 1; m <= i; m++) {
      cout << ans[l][m];
    }
    cout << endl;
  }
}
int main() {
  int k, i = 2, flag = 0, l, m, a_till;
  cin >> k;
  fill_comb();
  while (i < 100) {
    if (comb3[i + 1] > k) {
      break;
    } else if (comb3[i + 1] == k) {
      i++;
      break;
    } else {
      i++;
    }
  }
  for (l = 1; l <= i; l++) {
    for (m = 1; m <= i; m++) {
      if (l == m) {
        ans[l][m] = 0;
      } else {
        ans[l][m] = 1;
      }
    }
  }
  k = k - comb3[i];
  a_till = i;
  while (k > 0) {
    i = 1;
    while (i < 101) {
      if (comb2[i + 1] > k) {
        break;
      } else if (comb2[i + 1] == k) {
        i++;
        break;
      } else {
        i++;
      }
    }
    k = k - comb2[i];
    for (m = 1; m <= i; m++) {
      ans[a_till + 1][m] = 1;
      ans[m][a_till + 1] = 1;
    }
    a_till++;
  }
  cout << a_till << endl;
  give_result(a_till);
}
