#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2};
int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, a[105], t, total, res, ar[105][105], r[105], p[10005][105];
int main() {
  scanf("%d", &n);
  res = -1;
  for (__typeof(n) i = (1); i <= (n); i++) scanf("%d", &a[i]);
  int mn = 1000000, mx = 0;
  for (__typeof(n) i = (1); i <= (n); i++)
    mn = min(mn, a[i]), total += a[i], mx = max(mx, a[i]);
  for (int k = mn; k >= 0; k--) {
    mn = k;
    int u = total - (n * mn);
    t = u / 2;
    t = max(t, mx - mn);
    int rr = 0;
    memset(r, 0, sizeof r);
    memset(p, 0, sizeof p);
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= a[i] - mn; j++) {
        int c = 0;
        while (1) {
          rr++;
          if (p[rr][i] == 1)
            c++;
          else if (r[rr] + 1 <= 5) {
            p[rr][i] = 1;
            r[rr]++;
            if (rr == t) rr = 0;
            break;
          }
          if (rr >= t) {
            if (c == a[i] - mn) {
              t++;
            } else {
              c = 0;
              rr = 0;
            }
          }
        }
      }
    }
    if (k == 0) {
      res = 0;
      break;
    }
    int i = 1;
    for (; i <= t; i++)
      if (r[i] < 2) break;
    if (i > t) {
      res = k;
      break;
    }
  }
  if (res == 0) {
    for (__typeof(t) i = (1); i <= (t); i++) {
      if (r[i] < 2) {
        for (int j = 1; j <= n; j++) {
          if (p[i][j] == 0) {
            r[i]++;
            p[i][j] = 1;
            break;
          }
        }
      }
    }
  }
  printf("%d\n%d\n", res, t);
  for (__typeof(t) i = (1); i <= (t); i++) {
    for (__typeof(n) j = (1); j <= (n); j++) {
      printf("%d", p[i][j]);
    }
    printf("\n");
  }
  return 0;
}
