#include <bits/stdc++.h>
using namespace std;
const int N = 30;
const int M = N + 7;
const int MOD = 1e9 + 7;
const long long INF = 1e16 + 17;
int a[M];
bool dp[M][M << 1][(M * M) << 2];
bool par[M][M << 1][(M * M) << 2];
int ans[M << 1];
int an[M << 1][M << 1];
bool cmp(int i, int j) { return ans[i] < ans[j]; }
int main() {
  int m;
  scanf("%d", &m);
  for (int i = 1; i <= m; ++i) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + 1 + m);
  for (int n = 1; n <= 61; ++n) {
    memset(dp, 0, sizeof dp);
    memset(par, 0, sizeof par);
    int sum = n * (n - 1) / 2;
    dp[m][n][sum] = true;
    for (int i = m; i >= 1; --i) {
      for (int j = n; j >= 1; --j) {
        for (int k = sum; k >= a[i]; --k) {
          if (!dp[i][j][k]) continue;
          if ((j - 1) * (j - 2) / 2 <= k - a[i]) {
            dp[i - 1][j - 1][k - a[i]] = true;
            dp[i][j - 1][k - a[i]] = true;
            par[i - 1][j - 1][k - a[i]] = true;
          }
        }
      }
    }
    if (dp[0][0][0]) {
      int i = 0, j = 0, k = 0;
      while (j < n) {
        if (par[i][j][k]) i++;
        ans[j + 1] = a[i];
        j++;
        k += a[i];
      }
      while (true) {
        vector<int> ord;
        for (int i = 1; i <= n; ++i)
          if (ans[i] != -1) ord.push_back(i);
        sort(ord.begin(), ord.end(), cmp);
        for (int i = 1; i < (int)ord.size(); ++i) {
          if (i <= ans[ord[0]]) {
            an[ord[0]][ord[i]] = true;
          } else {
            ans[ord[i]]--;
            an[ord[i]][ord[0]] = true;
          }
        }
        if (ord.empty()) break;
        ans[ord[0]] = -1;
      }
      printf("%d\n", n);
      for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) printf("%d", an[i][j]);
        printf("\n");
      }
      return 0;
    }
  }
  printf("=(\n");
  return 0;
}
