#include <bits/stdc++.h>
using namespace std;
char res[200][200];
long long dp[1000][1000];
long long Dp[1000];
long long fact[1000];
int main() {
  int k, i = 0, a = 0, b = a + 1, c = b, li = 99, now = 0;
  cin >> k;
  for (int i = 0; i < 200; i++)
    dp[i][i] = dp[i][0] = dp[0][i] = 1, dp[1][i] = dp[i][1] = i;
  Dp[2] = 1;
  for (int i = 3; i < 200; i++) Dp[i] = Dp[i - 1] + i - 1;
  for (int i = 1; i < 150; i++)
    for (int j = 0; j < i; j++) dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
  for (int i = 0; i < 110; i++)
    for (int j = 0; j < 110; j++) res[i][j] = '0';
  res[0][1] = res[1][0] = '1';
  int tstp = li;
  while (tstp > 2 && dp[tstp][3] + i > k) tstp--;
  li = tstp;
  i += dp[tstp][3];
  int lnow = now;
  for (; now < tstp + lnow; now++)
    for (int j = lnow; j < lnow + tstp; j++)
      if (now != j) res[now][j] = res[j][now] = '1';
  tstp = 99;
  while (i != k) {
    while (tstp > 2 && Dp[tstp] + i > k) tstp--;
    for (int j = 0; j < tstp; j++)
      if (now != j) res[now][j] = res[j][now] = '1';
    i += Dp[tstp];
    now++;
  }
  cout << now << endl;
  for (int i = 0; i < now; i++, cout << endl)
    for (int j = 0; j < now; j++) cout << res[i][j];
  cin >> k;
}
