#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-11;
int k[110];
bool g[110][110];
void xz() {
  for (int n = 3; n <= 100; n++) {
    int a = 0;
    for (int i = 0; i < n; i++)
      for (int j = i + 1; j < n; j++)
        for (int k = j + 1; k < n; k++) a++;
    k[n] = a;
  }
}
inline int cnt() {
  int s = 0;
  for (int i = 0; i < 100; i++)
    for (int j = i + 1; j < 100; j++)
      for (int k = j + 1; k < 100; k++)
        if (g[i][j] && g[j][k] && g[k][i]) s++;
  return s;
}
void pr() {
  for (int i = 0; i < 100; i++) {
    for (int j = 0; j < 100; j++) cout << g[i][j];
    cout << endl;
  }
}
int n;
int sdv;
int s = 3;
int main() {
  srand(666);
  cout << setiosflags(ios::fixed) << setprecision(10);
  xz();
  cin >> n;
  while (k[s] < n) s++;
  for (int i = 0; i < s; i++)
    for (int j = 0; j < s; j++) {
      if (i == j)
        g[i][j] = 0;
      else
        g[i][j] = 1;
    }
  for (int i = 0; i < (2000); i++) {
    if (cnt() == n) break;
    while (cnt() > n) {
      int i = rand() % 100;
      int j = rand() % 100;
      if (g[i][j]) {
        g[i][j] = 0;
        g[j][i] = 0;
      }
    }
    while (cnt() < n) {
      bool fl = 1;
      for (int i = s; ((i < 100) && fl); i++)
        for (int j = 0; ((j < 100) && fl); j++)
          if ((i != j) && (g[i][j] == 0)) {
            g[i][j] = 1;
            g[j][i] = 1;
            fl = 0;
          }
    }
  }
  cout << 100 << endl;
  pr();
  return 0;
}
