Problem: Ivan is reading a book about tournaments. He knows that a tournament is an oriented graph with exactly one oriented edge between each pair of vertices. The score of a vertex is the number of edges going outside this vertex. 

Yesterday Ivan learned Landau's criterion: there is tournament with scores d1 ≤ d2 ≤ ... ≤ dn if and only if <image> for all 1 ≤ k < n and <image>.

Now, Ivan wanna solve following problem: given a set of numbers S = {a1, a2, ..., am}, is there a tournament with given set of scores? I.e. is there tournament with sequence of scores d1, d2, ..., dn such that if we remove duplicates in scores, we obtain the required set {a1, a2, ..., am}? 

Find a tournament with minimum possible number of vertices. 

Input

The first line contains a single integer m (1 ≤ m ≤ 31).

The next line contains m distinct integers a1, a2, ..., am (0 ≤ ai ≤ 30) — elements of the set S. It is guaranteed that all elements of the set are distinct.

Output

If there are no such tournaments, print string "=(" (without quotes).

Otherwise, print an integer n — the number of vertices in the tournament.

Then print n lines with n characters — matrix of the tournament. The j-th element in the i-th row should be 1 if the edge between the i-th and the j-th vertices is oriented towards the j-th vertex, and 0 otherwise. The main diagonal should contain only zeros.

Examples

Input

2
1 2


Output

4
0011
1001
0100
0010


Input

2
0 3


Output

6
000111
100011
110001
011001
001101
000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXM = 31;
const int MAXN = 61;
const int MAXSUM = 1830;
int m;
int a[MAXM];
int dp[MAXSUM + 1][MAXM][MAXN + 1];
int nxt[MAXSUM + 1][MAXM][MAXN + 1];
int n;
int want[MAXN];
int have[MAXN];
int g[MAXN][MAXN];
void run() {
  scanf("%d", &m);
  for (int i = (0); i < (m); ++i) scanf("%d", &a[i]);
  sort(a, a + m);
  memset(dp, -1, sizeof(dp));
  for (int sum = MAXSUM; sum >= 0; --sum)
    for (int i = (0); i < (m); ++i)
      for (int j = (0); j <= (MAXN); ++j) {
        if (sum < j * (j - 1) / 2) continue;
        if (i == m - 1 && sum == j * (j - 1) / 2) {
          dp[sum][i][j] = j;
          nxt[sum][i][j] = -1;
          continue;
        }
        if (sum + a[i] <= MAXSUM && j + 1 <= MAXN &&
            dp[sum + a[i]][i][j + 1] != -1 &&
            (dp[sum][i][j] == -1 ||
             dp[sum + a[i]][i][j + 1] <= dp[sum][i][j])) {
          dp[sum][i][j] = dp[sum + a[i]][i][j + 1];
          nxt[sum][i][j] = i;
        }
        if (i + 1 < m && sum + a[i + 1] <= MAXSUM && j + 1 <= MAXN &&
            dp[sum + a[i + 1]][i + 1][j + 1] != -1 &&
            (dp[sum][i][j] == -1 ||
             dp[sum + a[i + 1]][i + 1][j + 1] <= dp[sum][i][j])) {
          dp[sum][i][j] = dp[sum + a[i + 1]][i + 1][j + 1];
          nxt[sum][i][j] = i + 1;
        }
      }
  if (dp[a[0]][0][1] == -1) {
    printf("=(\n");
    return;
  }
  {
    n = 0;
    want[n++] = a[0];
    int sum = a[0], i = 0, j = 1;
    while (nxt[sum][i][j] != -1) {
      int cur = nxt[sum][i][j];
      want[n++] = a[cur];
      sum += a[cur], i = max(i, cur), ++j;
    }
  }
  sort(want, want + n);
  for (int i = (0); i < (n); ++i) have[i] = i;
  for (int i = (0); i < (n); ++i)
    for (int j = (0); j < (n); ++j) g[i][j] = i > j ? 1 : 0;
  while (true) {
    int p = 0;
    while (p < n && have[p] == want[p]) ++p;
    if (p >= n) break;
    assert(have[p] < want[p]);
    while (p + 1 < n && have[p + 1] == have[p]) ++p;
    int q = p + 1;
    while (q < n && have[q] <= want[q]) ++q;
    assert(q < n);
    int r = -1;
    for (int i = (0); i < (n); ++i)
      if (i != p && i != q && g[q][i] && g[i][p]) {
        r = i;
        break;
      }
    assert(r != -1);
    g[q][r] = g[r][p] = 0, g[p][r] = g[r][q] = 1, ++have[p], --have[q];
  }
  printf("%d\n", n);
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (n); ++j) printf("%d", g[i][j]);
    puts("");
  }
}
int main() {
  run();
  return 0;
}