#include <bits/stdc++.h>
using namespace std;
int n, a[35], dp[35][65][1835], zy[35][65][1835], val[35];
bool win[65][65];
vector<pair<int, int> > v;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  memset(dp, 0, sizeof(dp));
  dp[0][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = i - 1; j <= 61; j++) {
      for (int l = j * (j - 1) / 2; l <= 1830; l++) {
        if (dp[i - 1][j][l])
          for (int k = 1; k + j <= 61 && l + a[i] * k <= 1830; k++)
            if (l + a[i] * k >= (j + k) * (j + k - 1) / 2)
              dp[i][j + k][l + a[i] * k] = 1, zy[i][j + k][l + a[i] * k] = k;
      }
    }
  }
  int cnt = 0;
  for (int j = n; j <= 61; j++) {
    if (dp[n][j][j * (j - 1) / 2]) {
      cnt = j;
      break;
    }
  }
  int pos2 = cnt, pos3 = cnt * (cnt - 1) / 2, totcnt = 0;
  for (int i = n; i >= 1; i--) {
    val[i] = zy[i][pos2][pos3];
    pos2 -= val[i];
    pos3 -= val[i] * a[i];
    for (int j = 0; j < val[i]; j++) v.push_back(make_pair(a[i], ++totcnt));
  }
  sort(v.begin(), v.end());
  printf("%d\n", cnt);
  for (int i = 0; i < v.size(); i++) {
    for (int j = i + 1; j <= i + v[i].first; j++)
      win[v[i].second][v[j].second] = 1;
    for (int j = i + v[i].first + 1; j < v.size(); j++) {
      v[j].first--;
      win[v[j].second][v[i].second] = 1;
    }
    sort(v.begin() + i + 1, v.end());
  }
  for (int i = 1; i <= cnt; i++) {
    for (int j = 1; j <= cnt; j++) printf("%d", win[i][j]);
    puts("");
  }
  return 0;
}
