Problem: A group of n friends enjoys playing popular video game Toda 2. There is a rating system describing skill level of each player, initially the rating of the i-th friend is ri.

The friends decided to take part in the championship as a team. But they should have equal ratings to be allowed to compose a single team consisting of all n friends. So the friends are faced with the problem: how to make all their ratings equal.

One way to change ratings is to willingly lose in some matches. Friends can form a party consisting of two to five (but not more than n) friends and play a match in the game. When the party loses, the rating of each of its members decreases by 1. A rating can't become negative, so ri = 0 doesn't change after losing.

The friends can take part in multiple matches, each time making a party from any subset of friends (but remember about constraints on party size: from 2 to 5 members).

The friends want to make their ratings equal but as high as possible.

Help the friends develop a strategy of losing the matches so that all their ratings become equal and the resulting rating is maximum possible.

Input

The first line contains a single integer n (2 ≤ n ≤ 100) — the number of friends.

The second line contains n non-negative integers r1, r2, ..., rn (0 ≤ ri ≤ 100), where ri is the initial rating of the i-th friend.

Output

In the first line, print a single integer R — the final rating of each of the friends.

In the second line, print integer t — the number of matches the friends have to play. Each of the following t lines should contain n characters '0' or '1', where the j-th character of the i-th line is equal to:

  * '0', if friend j should not play in match i, 
  * '1', if friend j should play in match i. 



Each line should contain between two and five characters '1', inclusive.

The value t should not exceed 104, it is guaranteed that such solution exists. 

Remember that you shouldn't minimize the value t, but you should maximize R. If there are multiple solutions, print any of them.

Examples

Input

5
4 5 1 7 4


Output

1
8
01010
00011
01010
10010
00011
11000
00011
11000


Input

2
1 2


Output

0
2
11
11


Input

3
1 1 1


Output

1
0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 1;
char ans[maxn][101];
int cnt = 0, n;
struct node {
  int ind;
  int val;
  node() {}
  node(int i, int v) : ind(i), val(v) {}
  bool operator<(const node &p) const { return val > p.val; }
} score[105];
multiset<node> ss;
inline int counter() {
  int key = (ss.begin())->val;
  int cntt = 0;
  for (multiset<node>::iterator c = ss.begin(); c != ss.end(); ++c) {
    if (c->val == key)
      ++cntt;
    else
      break;
  }
  return cntt;
}
inline void deal(int k, int *a) {
  for (int i = 0; i < k; ++i) {
    if (score[a[i]].val > 0) score[a[i]].val -= 1;
    ss.insert(score[a[i]]);
  }
  for (int i = 0; i < n; ++i) {
    int ok = 0;
    for (int j = 0; j < k; ++j)
      if (a[j] == i) {
        ok = 1;
        break;
      }
    if (ok)
      ans[cnt][i] = '1';
    else
      ans[cnt][i] = '0';
  }
  cnt++;
}
void solve() {
  int cnt = counter();
  if (cnt == n) return;
  int k = 0, a[5];
  if (cnt == 1 || cnt % 2 == 0) {
    multiset<node>::iterator c = ss.begin();
    a[k++] = c->ind;
    ss.erase(c);
    c = ss.begin();
    a[k++] = c->ind;
    ss.erase(c);
    deal(k, a);
  } else if (cnt > 1 && cnt & 1) {
    multiset<node>::iterator c = ss.begin();
    a[k++] = c->ind;
    ss.erase(c);
    c = ss.begin();
    a[k++] = c->ind;
    ss.erase(c);
    c = ss.begin();
    a[k++] = c->ind;
    ss.erase(c);
    deal(k, a);
  }
  solve();
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &score[i].val);
    score[i].ind = i;
    ss.insert(score[i]);
  }
  solve();
  printf("%d\n", (ss.begin())->val);
  printf("%d\n", cnt);
  for (int i = 0; i < cnt; ++i) printf("%s\n", ans[i]);
  ss.clear();
  return 0;
}