#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
bitset<30 * N + 1> dp[N][32];
int a[N], out[N], id[N];
bitset<N> g[N];
void solve(vector<int> a) {
  int n = (int)a.size();
  for (int i = 0; i < n; ++i) out[i] = a[i];
  for (int i = 0; i < n; ++i) {
    int j = max_element(out, out + n) - out;
    int d = out[j];
    out[j] = -1;
    for (int k = 0; k < n; ++k) id[k] = k;
    sort(id, id + n, [&](int i, int j) { return out[i] > out[j]; });
    for (int k = 0; k < n - 1 - i; ++k) {
      if (k < n - 1 - i - d) {
        g[id[k]][j] = 1;
        out[id[k]]--;
      } else {
        g[j][id[k]] = 1;
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      putchar(g[i][j] ? '1' : '0');
      if (i != j) assert(g[i][j] + g[j][i] == 1);
    }
    puts("");
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  sort(a, a + n);
  dp[1][0][a[0]] = 1;
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int k = 0; k < i * (i - 1) / 2; ++k) dp[i][j][k] = 0;
      dp[i + 1][j] |= dp[i][j] << a[j];
      dp[i + 1][j + 1] |= dp[i][j] << a[j + 1];
    }
    if (dp[i + 1][n - 1][(i + 1) * i / 2]) {
      printf("%d\n", i + 1);
      int j = n - 1, k = (i + 1) * i / 2;
      vector<int> A;
      while (i > -1) {
        assert(dp[i + 1][j][k]);
        A.push_back(a[j]);
        k -= a[j];
        if (!dp[i][j][k]) j--;
        i--;
      }
      solve(A);
      return 0;
    }
  }
  puts("=(");
}
