#include <bits/stdc++.h>
#pragma GCC optimize("O3")
const int inf = INT_MAX;
const int nmax = 1e5 + 5;
const int mod = 1e9 + 7;
using namespace std;
int k, nr, ans[101][101], i, j, ed;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cerr.tie(0);
  cout.tie(0);
  cin >> k;
  for (i = 3; i * (i - 1) * (i - 2) / 6 <= k; i++) nr = i;
  for (i = 1; i <= nr; i++)
    for (j = i + 1; j <= nr; j++) ans[i][j] = ans[j][i] = 1;
  k -= nr * (nr - 1) * (nr - 2) / 6;
  while (k) {
    ed = 0;
    while (ed * (ed - 1) / 2 <= k) ed++;
    ed--, nr++;
    for (i = 1; i <= ed; i++) ans[i][nr] = ans[nr][i] = 1;
    k -= ed * (ed - 1) / 2;
  }
  cout << nr << endl;
  for (i = 1; i <= nr; i++) {
    for (j = 1; j <= nr; j++) cout << ans[i][j];
    cout << endl;
  }
  return 0;
}
