#include <bits/stdc++.h>
using namespace std;
int a[105], c[105], n, ans;
bool judge() {
  sort(c + 1, c + 1 + n);
  int cnt = 0, i;
  for (i = 1; i < n; i++) cnt += c[i];
  if (cnt < c[n])
    return false;
  else
    return true;
}
struct node {
  int num, lab;
  bool operator<(const node& a) const { return num < a.num; }
} e[105];
int main() {
  int i, j, mi = 999;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    mi = min(a[i], mi);
  }
  if (n == 2) {
    if (a[1] != a[2]) {
      printf("0\n");
      printf("%d\n", max(a[1], a[2]));
      for (i = 1; i <= max(a[1], a[2]); i++) printf("11\n");
    } else
      printf("%d\n0\n", a[1]);
    return 0;
  }
  for (ans = mi; ans >= 1; ans--) {
    for (j = 1; j <= n; j++) c[j] = a[j] - ans;
    if (judge()) break;
  }
  if (ans) {
    printf("%d\n", ans);
    for (i = 1; i <= n; i++) {
      e[i].num = a[i];
      e[i].lab = i;
    }
    sort(e + 1, e + 1 + n);
    int ss = 0;
    for (i = 1; i < n; i++) ss += e[i].num - ans;
    ss -= e[n].num - ans;
    int flag = ss % 2;
    ss /= 2;
    int dd = ss;
    ss += e[n].num - ans;
    printf("%d\n", ss);
    for (i = 1; i <= n - 2; i++) {
      while (e[i].num - ans > 0 && dd) {
        dd--;
        e[i].num--;
        e[i + 1].num--;
        for (j = 1; j <= n; j++) {
          if (j == e[i].lab || j == e[i + 1].lab)
            printf("1");
          else
            printf("0");
        }
        printf("\n");
      }
    }
    if (flag) {
      for (i = 1; i <= n; i++) {
        if (i == e[n].lab || i == e[n - 1].lab || i == e[n - 2].lab)
          printf("1");
        else
          printf("0");
      }
      printf("\n");
      e[n].num--;
      e[n - 1].num--;
      e[n - 2].num--;
    }
    for (i = 1; i < n; i++) {
      while (e[i].num - ans) {
        e[i].num--;
        for (j = 1; j <= n; j++) {
          if (j == e[i].lab || j == e[n].lab)
            printf("1");
          else
            printf("0");
        }
        printf("\n");
      }
    }
  } else {
    printf("0\n");
    int ss = 0;
    for (i = 2; i <= n; i++) {
      ss += a[i];
    }
    ss = max(a[1], ss);
    printf("%d\n", ss);
    for (i = 2; i <= n; i++) {
      while (a[i]) {
        printf("1");
        for (j = 2; j < i; j++) printf("0");
        printf("1");
        for (j = i + 1; j <= n; j++) printf("0");
        printf("\n");
        a[i]--;
        a[1] = max(a[1], 0);
      }
    }
    if (e[1].num) {
      for (i = 1; i <= e[1].num; i++) {
        printf("11");
        for (j = 3; j <= n; j++) printf("0");
        printf("\n");
      }
    }
  }
  return 0;
}
