#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e15;
const int N = 2e5 + 50;
long long binpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long modinverse(long long a, long long m) { return binpow(a, m - 2, m); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  int k;
  cin >> k;
  int ans[105][105];
  for (int i = 0; i <= 100; i++) {
    for (int j = 0; j <= 100; j++) {
      ans[i][j] = 0;
    }
  }
  int idx = 1;
  while (1) {
    long long val = idx * (idx - 1) * (idx - 2);
    val /= 6;
    if (val > k) {
      break;
    } else {
      idx++;
    }
  }
  idx--;
  for (long long i = 1; i <= idx; i++) {
    for (long long j = 1; j <= idx; j++) {
      if (j != i) ans[i][j] = 1;
    }
  }
  long long tot = (idx * (idx - 1) * (idx - 2)) / 6;
  idx++;
  while (tot < k) {
    int cnt = 0;
    for (long long j = 1; j <= idx; j++) {
      if (j == idx) {
        ans[j][j] = 0;
      } else {
        tot += cnt;
        cnt++;
        if (tot > k) break;
        ans[idx][j] = ans[j][idx] = 1;
      }
    }
    tot -= (cnt - 1);
    idx++;
  }
  cout << idx << "\n";
  for (long long i = 1; i <= idx; i++) {
    for (long long j = 1; j <= idx; j++) cout << ans[i][j];
    cout << "\n";
  }
}
