#include <bits/stdc++.h>
using namespace std;
long long gcd(long long n1, long long n2) {
  if (n2 == 0) return n1;
  if (n1 % n2 == 0) return n2;
  return gcd(n2, n1 % n2);
}
long long powmod(long long base, long long exponent) {
  if (exponent < 0) exponent += 1000000007LL - 1;
  long long ans = 1;
  while (exponent) {
    if (exponent & 1) ans = (ans * base) % 1000000007LL;
    base = (base * base) % 1000000007LL;
    exponent /= 2;
  }
  return ans;
}
int ret[105][105];
int f(int n) {
  int ans = n * (n - 1) * (n - 2);
  ans /= 6;
  return ans;
}
int f2(int n) {
  int ans = n * (n - 1);
  ans /= 2;
  return ans;
}
vector<int> ans;
int main() {
  int k;
  cin >> k;
  int now = 0;
  while (k > 0) {
    int perma = -1;
    for (int j = 2; j < 100; j++)
      if (f(j) + j * f2(now) + now * f2(j) > k) {
        j--;
        k -= f(j);
        perma = j;
        break;
      }
    int i = perma;
    for (int j = now; j < now + i; j++)
      for (int k = now; k < now + i; k++)
        if (j != k) ret[j][k] = 1;
    perma = 0;
    int per = 0;
    for (int kk = i; kk > 0; kk--)
      for (int j = now; j > 0; j--) {
        if (kk * f2(j) + j * f2(kk) <= k) {
          k -= kk * f2(j) + j * f2(kk);
          perma = j;
          per = kk;
          break;
        }
      }
    for (int j = 0; j < perma; j++) {
      for (int kk = 0; kk < per; kk++) {
        ret[j][now + kk] = 1;
        ret[now + kk][j] = 1;
      }
    }
    now += i;
  }
  cout << 100 << '\n';
  for (int i = 0; i < 100; i++) {
    for (int j = 0; j < 100; j++) {
      cout << ret[i][j];
    }
    cout << '\n';
  }
}
