#include <bits/stdc++.h>
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
using namespace std;
const int INF = 1000 * 1000 * 1000;
const int MOD = INF + 7;
const double EPS = 0.000000001;
const long long inf = (long long)1e18;
bool adj[101][101];
bool used[101];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int k;
  cin >> k;
  int n = 0;
  int cur = 100;
  while ((cur * cur * cur - cur * cur - 2 * cur * cur + 2 * cur) / 6 > k) {
    cur--;
  }
  k -= (cur * cur * cur - cur * cur - 2 * cur * cur + 2 * cur) / 6;
  for (int i = n; i < n + cur; i++) {
    for (int j = n; j < n + cur; j++) {
      if (i == j) continue;
      adj[i][j] = true;
    }
  }
  n += cur;
  while (k > 0) {
    if (n >= 100) return cout << n << endl, 0;
    int f = 0, s = 1;
    adj[n][f] = adj[f][n] = true;
    adj[n][s] = adj[s][n] = true;
    k--;
    int cnt = 2;
    while (k - cnt >= 0) {
      adj[n][cnt] = adj[cnt][n] = true;
      k -= cnt;
      cnt++;
    }
    n++;
  }
  cout << n << "\n";
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << adj[i][j];
    }
    cout << "\n";
  }
  return 0;
}
